/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/seq-pthread/cs_lazy.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 16:55:13,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 16:55:13,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 16:55:13,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 16:55:13,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 16:55:13,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 16:55:13,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 16:55:13,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 16:55:13,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 16:55:13,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 16:55:13,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 16:55:13,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 16:55:13,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 16:55:13,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 16:55:13,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 16:55:13,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 16:55:13,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 16:55:13,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 16:55:13,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 16:55:13,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 16:55:13,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 16:55:13,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 16:55:13,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 16:55:13,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 16:55:13,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 16:55:13,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 16:55:13,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 16:55:13,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 16:55:13,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 16:55:13,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 16:55:13,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 16:55:13,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 16:55:13,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 16:55:13,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 16:55:13,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 16:55:13,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 16:55:13,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 16:55:13,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 16:55:13,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 16:55:13,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 16:55:13,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 16:55:13,327 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-16 16:55:13,359 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 16:55:13,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 16:55:13,359 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 16:55:13,360 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 16:55:13,360 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 16:55:13,361 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 16:55:13,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 16:55:13,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 16:55:13,362 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 16:55:13,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 16:55:13,362 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 16:55:13,362 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 16:55:13,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 16:55:13,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 16:55:13,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 16:55:13,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 16:55:13,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 16:55:13,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 16:55:13,364 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 16:55:13,364 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 16:55:13,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 16:55:13,364 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 16:55:13,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 16:55:13,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 16:55:13,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 16:55:13,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 16:55:13,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 16:55:13,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 16:55:13,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 16:55:13,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 16:55:13,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 16:55:13,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 16:55:13,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 16:55:13,367 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-16 16:55:13,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 16:55:13,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 16:55:13,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 16:55:13,747 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 16:55:13,747 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 16:55:13,749 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-10-16 16:55:13,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6132093e/4c8b45d4add54ee9b32c923b36bb62cc/FLAG5a258c4ad [2022-10-16 16:55:14,573 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 16:55:14,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2022-10-16 16:55:14,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6132093e/4c8b45d4add54ee9b32c923b36bb62cc/FLAG5a258c4ad [2022-10-16 16:55:14,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6132093e/4c8b45d4add54ee9b32c923b36bb62cc [2022-10-16 16:55:14,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 16:55:14,873 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 16:55:14,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 16:55:14,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 16:55:14,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 16:55:14,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:55:14" (1/1) ... [2022-10-16 16:55:14,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7478be15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:14, skipping insertion in model container [2022-10-16 16:55:14,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:55:14" (1/1) ... [2022-10-16 16:55:14,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 16:55:14,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 16:55:15,320 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/seq-pthread/cs_lazy.i[23394,23407] [2022-10-16 16:55:15,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 16:55:15,495 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 16:55:15,526 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/seq-pthread/cs_lazy.i[23394,23407] [2022-10-16 16:55:15,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 16:55:15,613 INFO L208 MainTranslator]: Completed translation [2022-10-16 16:55:15,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:15 WrapperNode [2022-10-16 16:55:15,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 16:55:15,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 16:55:15,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 16:55:15,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 16:55:15,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:15" (1/1) ... [2022-10-16 16:55:15,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:15" (1/1) ... [2022-10-16 16:55:15,695 INFO L138 Inliner]: procedures = 145, calls = 212, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 522 [2022-10-16 16:55:15,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 16:55:15,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 16:55:15,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 16:55:15,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 16:55:15,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:15" (1/1) ... [2022-10-16 16:55:15,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:15" (1/1) ... [2022-10-16 16:55:15,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:15" (1/1) ... [2022-10-16 16:55:15,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:15" (1/1) ... [2022-10-16 16:55:15,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:15" (1/1) ... [2022-10-16 16:55:15,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:15" (1/1) ... [2022-10-16 16:55:15,767 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:15" (1/1) ... [2022-10-16 16:55:15,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:15" (1/1) ... [2022-10-16 16:55:15,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 16:55:15,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 16:55:15,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 16:55:15,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 16:55:15,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:15" (1/1) ... [2022-10-16 16:55:15,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 16:55:15,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 16:55:15,814 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-16 16:55:15,826 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-16 16:55:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 16:55:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 16:55:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 16:55:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 16:55:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 16:55:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-10-16 16:55:15,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-10-16 16:55:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-10-16 16:55:15,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-10-16 16:55:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 16:55:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-10-16 16:55:15,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-10-16 16:55:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-10-16 16:55:15,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-10-16 16:55:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 16:55:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 16:55:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-10-16 16:55:15,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-10-16 16:55:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 16:55:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-10-16 16:55:15,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-10-16 16:55:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 16:55:15,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 16:55:16,109 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 16:55:16,112 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 16:55:16,491 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-10-16 16:55:16,492 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2022-10-16 16:55:16,492 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-10-16 16:55:16,492 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !(0 != ~__CS_ret~0 % 256); [2022-10-16 16:55:16,492 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2022-10-16 16:55:16,492 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume 0 != ~__CS_ret~0 % 256;thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2022-10-16 16:55:16,493 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(0 != ~__CS_ret~0 % 256); [2022-10-16 16:55:18,032 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 16:55:18,048 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 16:55:18,048 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-16 16:55:18,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:55:18 BoogieIcfgContainer [2022-10-16 16:55:18,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 16:55:18,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 16:55:18,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 16:55:18,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 16:55:18,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:55:14" (1/3) ... [2022-10-16 16:55:18,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e40d5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:55:18, skipping insertion in model container [2022-10-16 16:55:18,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:55:15" (2/3) ... [2022-10-16 16:55:18,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e40d5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:55:18, skipping insertion in model container [2022-10-16 16:55:18,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:55:18" (3/3) ... [2022-10-16 16:55:18,062 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2022-10-16 16:55:18,083 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 16:55:18,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-10-16 16:55:18,149 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 16:55:18,158 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;@45f7c8b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 16:55:18,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-10-16 16:55:18,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 132 states have (on average 1.5606060606060606) internal successors, (206), 148 states have internal predecessors, (206), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-10-16 16:55:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-16 16:55:18,173 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:55:18,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-16 16:55:18,174 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:55:18,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:55:18,181 INFO L85 PathProgramCache]: Analyzing trace with hash 280635441, now seen corresponding path program 1 times [2022-10-16 16:55:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:55:18,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650055139] [2022-10-16 16:55:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:18,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:55:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:55:18,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:55:18,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650055139] [2022-10-16 16:55:18,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650055139] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:55:18,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:55:18,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 16:55:18,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410125101] [2022-10-16 16:55:18,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:55:18,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 16:55:18,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:55:18,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 16:55:18,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 16:55:18,683 INFO L87 Difference]: Start difference. First operand has 192 states, 132 states have (on average 1.5606060606060606) internal successors, (206), 148 states have internal predecessors, (206), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:55:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:55:18,791 INFO L93 Difference]: Finished difference Result 377 states and 593 transitions. [2022-10-16 16:55:18,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 16:55:18,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-16 16:55:18,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:55:18,808 INFO L225 Difference]: With dead ends: 377 [2022-10-16 16:55:18,808 INFO L226 Difference]: Without dead ends: 158 [2022-10-16 16:55:18,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 16:55:18,823 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 1 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 16:55:18,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 16:55:18,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-10-16 16:55:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-10-16 16:55:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 115 states have internal predecessors, (156), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-10-16 16:55:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 229 transitions. [2022-10-16 16:55:18,905 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 229 transitions. Word has length 5 [2022-10-16 16:55:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:55:18,905 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 229 transitions. [2022-10-16 16:55:18,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:55:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 229 transitions. [2022-10-16 16:55:18,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 16:55:18,909 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:55:18,910 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-10-16 16:55:18,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 16:55:18,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:55:18,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:55:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1890587857, now seen corresponding path program 1 times [2022-10-16 16:55:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:55:18,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524477363] [2022-10-16 16:55:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:55:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 16:55:19,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:55:19,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524477363] [2022-10-16 16:55:19,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524477363] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:55:19,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:55:19,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 16:55:19,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885888042] [2022-10-16 16:55:19,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:55:19,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 16:55:19,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:55:19,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 16:55:19,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 16:55:19,132 INFO L87 Difference]: Start difference. First operand 158 states and 229 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:55:19,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:55:19,182 INFO L93 Difference]: Finished difference Result 158 states and 229 transitions. [2022-10-16 16:55:19,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 16:55:19,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-16 16:55:19,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:55:19,186 INFO L225 Difference]: With dead ends: 158 [2022-10-16 16:55:19,187 INFO L226 Difference]: Without dead ends: 157 [2022-10-16 16:55:19,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 16:55:19,189 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 2 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 16:55:19,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 16:55:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-10-16 16:55:19,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-10-16 16:55:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 107 states have (on average 1.4485981308411215) internal successors, (155), 114 states have internal predecessors, (155), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-10-16 16:55:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 228 transitions. [2022-10-16 16:55:19,215 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 228 transitions. Word has length 8 [2022-10-16 16:55:19,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:55:19,215 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 228 transitions. [2022-10-16 16:55:19,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:55:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 228 transitions. [2022-10-16 16:55:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 16:55:19,216 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:55:19,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:55:19,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 16:55:19,217 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:55:19,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:55:19,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1521317165, now seen corresponding path program 1 times [2022-10-16 16:55:19,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:55:19,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144108436] [2022-10-16 16:55:19,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:19,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:55:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:55:19,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:55:19,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144108436] [2022-10-16 16:55:19,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144108436] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 16:55:19,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081296373] [2022-10-16 16:55:19,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:19,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 16:55:19,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 16:55:19,359 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-16 16:55:19,381 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-16 16:55:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:19,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 16:55:19,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 16:55:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 16:55:19,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 16:55:19,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081296373] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:55:19,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 16:55:19,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-10-16 16:55:19,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481713149] [2022-10-16 16:55:19,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:55:19,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 16:55:19,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:55:19,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 16:55:19,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:55:19,568 INFO L87 Difference]: Start difference. First operand 157 states and 228 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:55:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:55:19,614 INFO L93 Difference]: Finished difference Result 311 states and 454 transitions. [2022-10-16 16:55:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 16:55:19,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-16 16:55:19,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:55:19,618 INFO L225 Difference]: With dead ends: 311 [2022-10-16 16:55:19,618 INFO L226 Difference]: Without dead ends: 168 [2022-10-16 16:55:19,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:55:19,621 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 3 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 16:55:19,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 435 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 16:55:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-10-16 16:55:19,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2022-10-16 16:55:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 116 states have (on average 1.4310344827586208) internal successors, (166), 123 states have internal predecessors, (166), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-10-16 16:55:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 239 transitions. [2022-10-16 16:55:19,642 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 239 transitions. Word has length 9 [2022-10-16 16:55:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:55:19,642 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 239 transitions. [2022-10-16 16:55:19,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:55:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 239 transitions. [2022-10-16 16:55:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 16:55:19,643 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:55:19,643 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-10-16 16:55:19,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 16:55:19,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 16:55:19,858 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:55:19,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:55:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1521318894, now seen corresponding path program 1 times [2022-10-16 16:55:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:55:19,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705410650] [2022-10-16 16:55:19,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:19,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:55:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:55:20,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:55:20,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705410650] [2022-10-16 16:55:20,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705410650] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 16:55:20,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138370324] [2022-10-16 16:55:20,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:20,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 16:55:20,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 16:55:20,074 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-16 16:55:20,080 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-16 16:55:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:20,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 16:55:20,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 16:55:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:55:20,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 16:55:20,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138370324] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:55:20,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 16:55:20,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-10-16 16:55:20,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072154187] [2022-10-16 16:55:20,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:55:20,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 16:55:20,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:55:20,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 16:55:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:55:20,314 INFO L87 Difference]: Start difference. First operand 166 states and 239 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:55:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:55:20,368 INFO L93 Difference]: Finished difference Result 166 states and 239 transitions. [2022-10-16 16:55:20,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 16:55:20,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-16 16:55:20,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:55:20,373 INFO L225 Difference]: With dead ends: 166 [2022-10-16 16:55:20,373 INFO L226 Difference]: Without dead ends: 165 [2022-10-16 16:55:20,374 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-16 16:55:20,378 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 54 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 16:55:20,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 410 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 16:55:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-10-16 16:55:20,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-10-16 16:55:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 112 states have (on average 1.4285714285714286) internal successors, (160), 118 states have internal predecessors, (160), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-10-16 16:55:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 233 transitions. [2022-10-16 16:55:20,424 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 233 transitions. Word has length 9 [2022-10-16 16:55:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:55:20,424 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 233 transitions. [2022-10-16 16:55:20,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:55:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 233 transitions. [2022-10-16 16:55:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 16:55:20,426 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:55:20,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:55:20,470 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-16 16:55:20,642 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,SelfDestructingSolverStorable3 [2022-10-16 16:55:20,643 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:55:20,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:55:20,644 INFO L85 PathProgramCache]: Analyzing trace with hash -83807815, now seen corresponding path program 1 times [2022-10-16 16:55:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:55:20,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158247700] [2022-10-16 16:55:20,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:20,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:55:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:55:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:55:20,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158247700] [2022-10-16 16:55:20,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158247700] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 16:55:20,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059482928] [2022-10-16 16:55:20,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:20,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 16:55:20,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 16:55:20,737 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 16:55:20,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 16:55:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:20,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 16:55:20,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 16:55:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 16:55:20,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 16:55:20,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059482928] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:55:20,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 16:55:20,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-10-16 16:55:20,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213919512] [2022-10-16 16:55:20,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:55:20,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 16:55:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:55:20,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 16:55:20,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:55:20,910 INFO L87 Difference]: Start difference. First operand 161 states and 233 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:55:20,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:55:20,933 INFO L93 Difference]: Finished difference Result 161 states and 233 transitions. [2022-10-16 16:55:20,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 16:55:20,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-16 16:55:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:55:20,935 INFO L225 Difference]: With dead ends: 161 [2022-10-16 16:55:20,935 INFO L226 Difference]: Without dead ends: 160 [2022-10-16 16:55:20,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:55:20,937 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 22 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 16:55:20,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 405 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 16:55:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-10-16 16:55:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-10-16 16:55:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 112 states have (on average 1.4196428571428572) internal successors, (159), 117 states have internal predecessors, (159), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-10-16 16:55:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 232 transitions. [2022-10-16 16:55:20,950 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 232 transitions. Word has length 10 [2022-10-16 16:55:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:55:20,950 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 232 transitions. [2022-10-16 16:55:20,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:55:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 232 transitions. [2022-10-16 16:55:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 16:55:20,952 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:55:20,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-10-16 16:55:20,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 16:55:21,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 16:55:21,166 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:55:21,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:55:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash -186043306, now seen corresponding path program 1 times [2022-10-16 16:55:21,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:55:21,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781991314] [2022-10-16 16:55:21,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:21,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:55:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 16:55:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:55:21,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781991314] [2022-10-16 16:55:21,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781991314] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 16:55:21,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475387605] [2022-10-16 16:55:21,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:21,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 16:55:21,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 16:55:21,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 16:55:21,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 16:55:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:21,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 16:55:21,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 16:55:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 16:55:21,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 16:55:21,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475387605] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:55:21,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 16:55:21,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-10-16 16:55:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321036548] [2022-10-16 16:55:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:55:21,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 16:55:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:55:21,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 16:55:21,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:55:21,458 INFO L87 Difference]: Start difference. First operand 160 states and 232 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:55:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:55:21,481 INFO L93 Difference]: Finished difference Result 160 states and 232 transitions. [2022-10-16 16:55:21,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 16:55:21,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-16 16:55:21,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:55:21,483 INFO L225 Difference]: With dead ends: 160 [2022-10-16 16:55:21,483 INFO L226 Difference]: Without dead ends: 159 [2022-10-16 16:55:21,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:55:21,485 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 1 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 16:55:21,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 429 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 16:55:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-10-16 16:55:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2022-10-16 16:55:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 110 states have internal predecessors, (151), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-10-16 16:55:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 224 transitions. [2022-10-16 16:55:21,528 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 224 transitions. Word has length 17 [2022-10-16 16:55:21,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:55:21,528 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 224 transitions. [2022-10-16 16:55:21,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 16:55:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 224 transitions. [2022-10-16 16:55:21,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 16:55:21,533 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:55:21,533 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:55:21,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 16:55:21,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 16:55:21,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:55:21,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:55:21,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1521421798, now seen corresponding path program 1 times [2022-10-16 16:55:21,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:55:21,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693210925] [2022-10-16 16:55:21,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:21,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:55:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:22,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-10-16 16:55:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:22,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-16 16:55:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:22,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 16:55:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 16:55:22,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:55:22,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693210925] [2022-10-16 16:55:22,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693210925] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 16:55:22,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142318025] [2022-10-16 16:55:22,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:22,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 16:55:22,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 16:55:22,039 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 16:55:22,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 16:55:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:22,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 16:55:22,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 16:55:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 16:55:22,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 16:55:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 16:55:22,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142318025] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 16:55:22,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 16:55:22,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-10-16 16:55:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394343364] [2022-10-16 16:55:22,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 16:55:22,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 16:55:22,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:55:22,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 16:55:22,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-10-16 16:55:22,419 INFO L87 Difference]: Start difference. First operand 153 states and 224 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 16:55:24,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:55:26,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:55:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:55:27,058 INFO L93 Difference]: Finished difference Result 318 states and 469 transitions. [2022-10-16 16:55:27,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 16:55:27,059 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2022-10-16 16:55:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:55:27,063 INFO L225 Difference]: With dead ends: 318 [2022-10-16 16:55:27,064 INFO L226 Difference]: Without dead ends: 168 [2022-10-16 16:55:27,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-10-16 16:55:27,066 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 74 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 84 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-10-16 16:55:27,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 525 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 259 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-10-16 16:55:27,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-10-16 16:55:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 162. [2022-10-16 16:55:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 115 states have (on average 1.391304347826087) internal successors, (160), 119 states have internal predecessors, (160), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-10-16 16:55:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 233 transitions. [2022-10-16 16:55:27,084 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 233 transitions. Word has length 55 [2022-10-16 16:55:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:55:27,084 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 233 transitions. [2022-10-16 16:55:27,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 16:55:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 233 transitions. [2022-10-16 16:55:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-16 16:55:27,087 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:55:27,088 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:55:27,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 16:55:27,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 16:55:27,302 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:55:27,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:55:27,304 INFO L85 PathProgramCache]: Analyzing trace with hash -784242173, now seen corresponding path program 1 times [2022-10-16 16:55:27,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:55:27,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690679397] [2022-10-16 16:55:27,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:27,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:55:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:27,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-16 16:55:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:27,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-16 16:55:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:27,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-16 16:55:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-10-16 16:55:27,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:55:27,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690679397] [2022-10-16 16:55:27,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690679397] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 16:55:27,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548847754] [2022-10-16 16:55:27,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:27,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 16:55:27,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 16:55:27,707 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 16:55:27,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 16:55:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:28,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 16:55:28,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 16:55:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-10-16 16:55:28,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 16:55:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-10-16 16:55:28,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548847754] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 16:55:28,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 16:55:28,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2022-10-16 16:55:28,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4703524] [2022-10-16 16:55:28,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 16:55:28,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 16:55:28,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:55:28,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 16:55:28,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 16:55:28,195 INFO L87 Difference]: Start difference. First operand 162 states and 233 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 16:55:29,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:55:31,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:55:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:55:31,909 INFO L93 Difference]: Finished difference Result 327 states and 475 transitions. [2022-10-16 16:55:31,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 16:55:31,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-10-16 16:55:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:55:31,912 INFO L225 Difference]: With dead ends: 327 [2022-10-16 16:55:31,912 INFO L226 Difference]: Without dead ends: 185 [2022-10-16 16:55:31,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-10-16 16:55:31,914 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 76 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 81 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-10-16 16:55:31,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 519 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 260 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-10-16 16:55:31,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-10-16 16:55:31,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2022-10-16 16:55:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 132 states have (on average 1.3484848484848484) internal successors, (178), 136 states have internal predecessors, (178), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-10-16 16:55:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 251 transitions. [2022-10-16 16:55:31,931 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 251 transitions. Word has length 58 [2022-10-16 16:55:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:55:31,931 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 251 transitions. [2022-10-16 16:55:31,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 16:55:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 251 transitions. [2022-10-16 16:55:31,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-10-16 16:55:31,933 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:55:31,934 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:55:31,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-10-16 16:55:32,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 16:55:32,149 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:55:32,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:55:32,150 INFO L85 PathProgramCache]: Analyzing trace with hash 473135197, now seen corresponding path program 2 times [2022-10-16 16:55:32,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:55:32,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872088224] [2022-10-16 16:55:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:32,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:55:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:33,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 16:55:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:33,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 16:55:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:33,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 16:55:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-10-16 16:55:33,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:55:33,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872088224] [2022-10-16 16:55:33,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872088224] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 16:55:33,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482247272] [2022-10-16 16:55:33,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 16:55:33,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 16:55:33,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 16:55:33,653 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 16:55:33,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 16:55:34,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 16:55:34,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 16:55:34,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 13 conjunts are in the unsatisfiable core [2022-10-16 16:55:34,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 16:55:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-10-16 16:55:34,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 16:55:34,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482247272] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:55:34,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 16:55:34,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-10-16 16:55:34,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609547037] [2022-10-16 16:55:34,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:55:34,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 16:55:34,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:55:34,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 16:55:34,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-10-16 16:55:34,249 INFO L87 Difference]: Start difference. First operand 179 states and 251 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 16:55:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:55:34,644 INFO L93 Difference]: Finished difference Result 385 states and 586 transitions. [2022-10-16 16:55:34,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 16:55:34,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 81 [2022-10-16 16:55:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:55:34,648 INFO L225 Difference]: With dead ends: 385 [2022-10-16 16:55:34,648 INFO L226 Difference]: Without dead ends: 246 [2022-10-16 16:55:34,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-10-16 16:55:34,651 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 329 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 16:55:34,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 515 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 16:55:34,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-10-16 16:55:34,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 239. [2022-10-16 16:55:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 182 states have (on average 1.2582417582417582) internal successors, (229), 165 states have internal predecessors, (229), 43 states have call successors, (43), 7 states have call predecessors, (43), 10 states have return successors, (72), 66 states have call predecessors, (72), 42 states have call successors, (72) [2022-10-16 16:55:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 344 transitions. [2022-10-16 16:55:34,676 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 344 transitions. Word has length 81 [2022-10-16 16:55:34,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:55:34,676 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 344 transitions. [2022-10-16 16:55:34,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 16:55:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 344 transitions. [2022-10-16 16:55:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-10-16 16:55:34,679 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:55:34,679 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:55:34,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-10-16 16:55:34,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 16:55:34,894 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:55:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:55:34,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1818176456, now seen corresponding path program 1 times [2022-10-16 16:55:34,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:55:34,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418319276] [2022-10-16 16:55:34,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:34,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:55:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:36,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 16:55:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:36,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-16 16:55:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:36,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 16:55:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-10-16 16:55:36,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:55:36,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418319276] [2022-10-16 16:55:36,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418319276] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:55:36,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:55:36,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 16:55:36,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604868994] [2022-10-16 16:55:36,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:55:36,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 16:55:36,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:55:36,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 16:55:36,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 16:55:36,590 INFO L87 Difference]: Start difference. First operand 239 states and 344 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 16:55:38,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:55:40,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:55:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:55:41,019 INFO L93 Difference]: Finished difference Result 438 states and 645 transitions. [2022-10-16 16:55:41,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 16:55:41,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 80 [2022-10-16 16:55:41,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:55:41,023 INFO L225 Difference]: With dead ends: 438 [2022-10-16 16:55:41,023 INFO L226 Difference]: Without dead ends: 243 [2022-10-16 16:55:41,025 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-16 16:55:41,026 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 62 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 79 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-10-16 16:55:41,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 531 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 242 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-10-16 16:55:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-10-16 16:55:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2022-10-16 16:55:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 182 states have (on average 1.2527472527472527) internal successors, (228), 165 states have internal predecessors, (228), 43 states have call successors, (43), 7 states have call predecessors, (43), 10 states have return successors, (72), 66 states have call predecessors, (72), 42 states have call successors, (72) [2022-10-16 16:55:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 343 transitions. [2022-10-16 16:55:41,049 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 343 transitions. Word has length 80 [2022-10-16 16:55:41,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:55:41,049 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 343 transitions. [2022-10-16 16:55:41,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 16:55:41,050 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 343 transitions. [2022-10-16 16:55:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-16 16:55:41,052 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:55:41,052 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:55:41,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 16:55:41,052 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:55:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:55:41,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1189722654, now seen corresponding path program 1 times [2022-10-16 16:55:41,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:55:41,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472108744] [2022-10-16 16:55:41,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:41,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:55:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:54,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-16 16:55:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:54,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 16:55:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:54,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 16:55:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:54,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-10-16 16:55:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:54,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-16 16:55:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:55:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-10-16 16:55:54,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:55:54,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472108744] [2022-10-16 16:55:54,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472108744] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:55:54,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:55:54,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-16 16:55:54,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850720961] [2022-10-16 16:55:54,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:55:54,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 16:55:54,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:55:54,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 16:55:54,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-10-16 16:55:54,361 INFO L87 Difference]: Start difference. First operand 239 states and 343 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-16 16:55:56,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:55:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:55:57,830 INFO L93 Difference]: Finished difference Result 544 states and 788 transitions. [2022-10-16 16:55:57,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 16:55:57,831 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 101 [2022-10-16 16:55:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:55:57,839 INFO L225 Difference]: With dead ends: 544 [2022-10-16 16:55:57,840 INFO L226 Difference]: Without dead ends: 351 [2022-10-16 16:55:57,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-10-16 16:55:57,843 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 166 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 108 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-10-16 16:55:57,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 766 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 983 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-10-16 16:55:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-10-16 16:55:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 342. [2022-10-16 16:55:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 265 states have (on average 1.2264150943396226) internal successors, (325), 241 states have internal predecessors, (325), 56 states have call successors, (56), 11 states have call predecessors, (56), 17 states have return successors, (101), 89 states have call predecessors, (101), 54 states have call successors, (101) [2022-10-16 16:55:57,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 482 transitions. [2022-10-16 16:55:57,892 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 482 transitions. Word has length 101 [2022-10-16 16:55:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:55:57,892 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 482 transitions. [2022-10-16 16:55:57,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-16 16:55:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 482 transitions. [2022-10-16 16:55:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-10-16 16:55:57,902 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:55:57,902 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:55:57,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 16:55:57,902 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:55:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:55:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1386683096, now seen corresponding path program 1 times [2022-10-16 16:55:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:55:57,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540052997] [2022-10-16 16:55:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:55:57,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:55:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-16 16:56:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:03,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 16:56:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:03,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 16:56:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:03,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 16:56:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:03,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 16:56:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-10-16 16:56:03,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:56:03,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540052997] [2022-10-16 16:56:03,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540052997] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:56:03,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:56:03,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-16 16:56:03,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808984723] [2022-10-16 16:56:03,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:56:03,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 16:56:03,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:56:03,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 16:56:03,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-10-16 16:56:03,694 INFO L87 Difference]: Start difference. First operand 342 states and 482 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-16 16:56:05,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:56:07,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:56:09,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:56:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:56:11,668 INFO L93 Difference]: Finished difference Result 879 states and 1254 transitions. [2022-10-16 16:56:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 16:56:11,669 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 105 [2022-10-16 16:56:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:56:11,674 INFO L225 Difference]: With dead ends: 879 [2022-10-16 16:56:11,675 INFO L226 Difference]: Without dead ends: 556 [2022-10-16 16:56:11,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-10-16 16:56:11,678 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 442 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 331 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-10-16 16:56:11,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 745 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 938 Invalid, 2 Unknown, 0 Unchecked, 7.6s Time] [2022-10-16 16:56:11,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-10-16 16:56:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 461. [2022-10-16 16:56:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 355 states have (on average 1.2140845070422535) internal successors, (431), 331 states have internal predecessors, (431), 77 states have call successors, (77), 18 states have call predecessors, (77), 25 states have return successors, (136), 111 states have call predecessors, (136), 76 states have call successors, (136) [2022-10-16 16:56:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 644 transitions. [2022-10-16 16:56:11,789 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 644 transitions. Word has length 105 [2022-10-16 16:56:11,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:56:11,791 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 644 transitions. [2022-10-16 16:56:11,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-16 16:56:11,791 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 644 transitions. [2022-10-16 16:56:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-10-16 16:56:11,793 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:56:11,793 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:56:11,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 16:56:11,794 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:56:11,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:56:11,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1551390419, now seen corresponding path program 1 times [2022-10-16 16:56:11,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:56:11,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814822447] [2022-10-16 16:56:11,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:56:11,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:56:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:13,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 16:56:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:13,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 16:56:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:13,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 16:56:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-10-16 16:56:13,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:56:13,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814822447] [2022-10-16 16:56:13,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814822447] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:56:13,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:56:13,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 16:56:13,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134214282] [2022-10-16 16:56:13,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:56:13,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 16:56:13,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:56:13,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 16:56:13,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 16:56:13,076 INFO L87 Difference]: Start difference. First operand 461 states and 644 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 16:56:15,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:56:17,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:56:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:56:18,009 INFO L93 Difference]: Finished difference Result 1106 states and 1594 transitions. [2022-10-16 16:56:18,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 16:56:18,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 78 [2022-10-16 16:56:18,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:56:18,017 INFO L225 Difference]: With dead ends: 1106 [2022-10-16 16:56:18,017 INFO L226 Difference]: Without dead ends: 690 [2022-10-16 16:56:18,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-10-16 16:56:18,022 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 335 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 185 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-10-16 16:56:18,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 764 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 442 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-10-16 16:56:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-10-16 16:56:18,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 637. [2022-10-16 16:56:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 482 states have (on average 1.2365145228215768) internal successors, (596), 447 states have internal predecessors, (596), 113 states have call successors, (113), 24 states have call predecessors, (113), 38 states have return successors, (227), 165 states have call predecessors, (227), 111 states have call successors, (227) [2022-10-16 16:56:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 936 transitions. [2022-10-16 16:56:18,104 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 936 transitions. Word has length 78 [2022-10-16 16:56:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:56:18,105 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 936 transitions. [2022-10-16 16:56:18,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 16:56:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 936 transitions. [2022-10-16 16:56:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-10-16 16:56:18,108 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:56:18,108 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:56:18,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 16:56:18,109 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:56:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:56:18,109 INFO L85 PathProgramCache]: Analyzing trace with hash -12038797, now seen corresponding path program 1 times [2022-10-16 16:56:18,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:56:18,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125600614] [2022-10-16 16:56:18,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:56:18,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:56:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:24,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-16 16:56:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:24,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 16:56:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:24,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 16:56:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:24,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 16:56:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:24,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-10-16 16:56:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-10-16 16:56:24,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:56:24,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125600614] [2022-10-16 16:56:24,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125600614] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:56:24,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:56:24,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-16 16:56:24,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885558153] [2022-10-16 16:56:24,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:56:24,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 16:56:24,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:56:24,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 16:56:24,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-10-16 16:56:24,399 INFO L87 Difference]: Start difference. First operand 637 states and 936 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-16 16:56:26,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:56:27,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:56:27,645 INFO L93 Difference]: Finished difference Result 1168 states and 1689 transitions. [2022-10-16 16:56:27,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 16:56:27,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2022-10-16 16:56:27,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:56:27,651 INFO L225 Difference]: With dead ends: 1168 [2022-10-16 16:56:27,651 INFO L226 Difference]: Without dead ends: 555 [2022-10-16 16:56:27,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-10-16 16:56:27,656 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 318 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 240 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-10-16 16:56:27,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 683 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 729 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-10-16 16:56:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-10-16 16:56:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 521. [2022-10-16 16:56:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 392 states have (on average 1.239795918367347) internal successors, (486), 358 states have internal predecessors, (486), 96 states have call successors, (96), 19 states have call predecessors, (96), 29 states have return successors, (180), 143 states have call predecessors, (180), 94 states have call successors, (180) [2022-10-16 16:56:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 762 transitions. [2022-10-16 16:56:27,721 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 762 transitions. Word has length 103 [2022-10-16 16:56:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:56:27,722 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 762 transitions. [2022-10-16 16:56:27,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-16 16:56:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 762 transitions. [2022-10-16 16:56:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-16 16:56:27,724 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:56:27,724 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:56:27,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 16:56:27,724 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:56:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:56:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1815051106, now seen corresponding path program 1 times [2022-10-16 16:56:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:56:27,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965812109] [2022-10-16 16:56:27,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:56:27,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:56:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:28,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-16 16:56:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:28,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 16:56:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:29,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 16:56:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:29,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-10-16 16:56:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:29,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-16 16:56:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-10-16 16:56:29,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:56:29,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965812109] [2022-10-16 16:56:29,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965812109] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 16:56:29,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620353204] [2022-10-16 16:56:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:56:29,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 16:56:29,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 16:56:29,048 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 16:56:29,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-16 16:56:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:29,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 1298 conjuncts, 78 conjunts are in the unsatisfiable core [2022-10-16 16:56:29,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 16:56:29,829 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-10-16 16:56:29,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 56 [2022-10-16 16:56:30,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-10-16 16:56:30,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-10-16 16:56:30,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-10-16 16:56:30,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-10-16 16:56:30,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-10-16 16:56:31,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-10-16 16:56:31,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-10-16 16:56:31,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-10-16 16:56:32,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2022-10-16 16:56:32,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 16:56:32,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-10-16 16:56:32,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 16:56:32,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 16:56:32,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 16:56:32,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 16:56:32,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 16:56:32,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 16:56:32,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 16:56:32,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 16:56:32,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 16:56:32,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 16:56:32,749 INFO L356 Elim1Store]: treesize reduction 130, result has 29.7 percent of original size [2022-10-16 16:56:32,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 75 [2022-10-16 16:56:32,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-10-16 16:56:32,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-10-16 16:56:33,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 16:56:33,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 16:56:33,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-16 16:56:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 22 proven. 28 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-10-16 16:56:33,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 16:56:33,363 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5935 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_5935) |c_~#__CS_thread_allocated~0.base|) (+ |c_~#__CS_thread_allocated~0.offset| 1)) 256) 1))) is different from false [2022-10-16 16:56:33,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620353204] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 16:56:33,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 16:56:33,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2022-10-16 16:56:33,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152329109] [2022-10-16 16:56:33,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 16:56:33,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-16 16:56:33,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:56:33,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-16 16:56:33,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=507, Unknown=1, NotChecked=46, Total=650 [2022-10-16 16:56:33,405 INFO L87 Difference]: Start difference. First operand 521 states and 762 transitions. Second operand has 20 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 16 states have internal predecessors, (109), 5 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-10-16 16:56:36,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:56:37,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:56:40,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:56:42,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:56:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:56:46,283 INFO L93 Difference]: Finished difference Result 1074 states and 1583 transitions. [2022-10-16 16:56:46,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 16:56:46,283 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 16 states have internal predecessors, (109), 5 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 101 [2022-10-16 16:56:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:56:46,290 INFO L225 Difference]: With dead ends: 1074 [2022-10-16 16:56:46,290 INFO L226 Difference]: Without dead ends: 602 [2022-10-16 16:56:46,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=539, Invalid=2116, Unknown=1, NotChecked=100, Total=2756 [2022-10-16 16:56:46,296 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 484 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 370 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 2647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-10-16 16:56:46,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1222 Invalid, 2647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 2274 Invalid, 3 Unknown, 0 Unchecked, 11.5s Time] [2022-10-16 16:56:46,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-10-16 16:56:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 267. [2022-10-16 16:56:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 204 states have (on average 1.2058823529411764) internal successors, (246), 189 states have internal predecessors, (246), 45 states have call successors, (45), 9 states have call predecessors, (45), 14 states have return successors, (84), 68 states have call predecessors, (84), 44 states have call successors, (84) [2022-10-16 16:56:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 375 transitions. [2022-10-16 16:56:46,355 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 375 transitions. Word has length 101 [2022-10-16 16:56:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:56:46,355 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 375 transitions. [2022-10-16 16:56:46,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 16 states have internal predecessors, (109), 5 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-10-16 16:56:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 375 transitions. [2022-10-16 16:56:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-10-16 16:56:46,358 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:56:46,358 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:56:46,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-10-16 16:56:46,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-16 16:56:46,573 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:56:46,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:56:46,574 INFO L85 PathProgramCache]: Analyzing trace with hash 24307727, now seen corresponding path program 1 times [2022-10-16 16:56:46,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:56:46,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711266626] [2022-10-16 16:56:46,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:56:46,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:56:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:47,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-16 16:56:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:47,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 16:56:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:47,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 16:56:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:47,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-16 16:56:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:47,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-16 16:56:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:47,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-10-16 16:56:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:47,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-16 16:56:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:47,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-10-16 16:56:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-10-16 16:56:47,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:56:47,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711266626] [2022-10-16 16:56:47,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711266626] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:56:47,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:56:47,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-16 16:56:47,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013941521] [2022-10-16 16:56:47,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:56:47,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 16:56:47,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:56:47,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 16:56:47,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-10-16 16:56:47,325 INFO L87 Difference]: Start difference. First operand 267 states and 375 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 6 states have internal predecessors, (58), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-10-16 16:56:50,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:56:52,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:56:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:56:53,702 INFO L93 Difference]: Finished difference Result 619 states and 915 transitions. [2022-10-16 16:56:53,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 16:56:53,702 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 6 states have internal predecessors, (58), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 136 [2022-10-16 16:56:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:56:53,707 INFO L225 Difference]: With dead ends: 619 [2022-10-16 16:56:53,707 INFO L226 Difference]: Without dead ends: 409 [2022-10-16 16:56:53,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-10-16 16:56:53,710 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 348 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 231 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-10-16 16:56:53,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 806 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 886 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-10-16 16:56:53,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-10-16 16:56:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 369. [2022-10-16 16:56:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 272 states have (on average 1.2169117647058822) internal successors, (331), 253 states have internal predecessors, (331), 72 states have call successors, (72), 14 states have call predecessors, (72), 21 states have return successors, (140), 101 states have call predecessors, (140), 71 states have call successors, (140) [2022-10-16 16:56:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 543 transitions. [2022-10-16 16:56:53,805 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 543 transitions. Word has length 136 [2022-10-16 16:56:53,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:56:53,805 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 543 transitions. [2022-10-16 16:56:53,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 6 states have internal predecessors, (58), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-10-16 16:56:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 543 transitions. [2022-10-16 16:56:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-10-16 16:56:53,808 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:56:53,808 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:56:53,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 16:56:53,809 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:56:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:56:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash 862268315, now seen corresponding path program 1 times [2022-10-16 16:56:53,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:56:53,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078873454] [2022-10-16 16:56:53,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:56:53,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:56:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:58,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-16 16:56:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:59,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 16:56:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:59,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 16:56:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:59,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-16 16:56:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:59,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-16 16:56:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:59,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 16:56:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:59,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-10-16 16:56:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:59,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-16 16:56:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:56:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-10-16 16:56:59,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:56:59,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078873454] [2022-10-16 16:56:59,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078873454] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:56:59,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:56:59,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-10-16 16:56:59,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380359172] [2022-10-16 16:56:59,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:56:59,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 16:56:59,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:56:59,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 16:56:59,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-10-16 16:56:59,735 INFO L87 Difference]: Start difference. First operand 369 states and 543 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 11 states have internal predecessors, (56), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-10-16 16:57:01,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 16:57:06,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:57:06,060 INFO L93 Difference]: Finished difference Result 949 states and 1428 transitions. [2022-10-16 16:57:06,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 16:57:06,060 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 11 states have internal predecessors, (56), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 134 [2022-10-16 16:57:06,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:57:06,067 INFO L225 Difference]: With dead ends: 949 [2022-10-16 16:57:06,067 INFO L226 Difference]: Without dead ends: 640 [2022-10-16 16:57:06,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=342, Invalid=1464, Unknown=0, NotChecked=0, Total=1806 [2022-10-16 16:57:06,072 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 1100 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 782 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 3011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 782 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-10-16 16:57:06,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 1270 Invalid, 3011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [782 Valid, 2228 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-10-16 16:57:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-10-16 16:57:06,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 566. [2022-10-16 16:57:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 424 states have (on average 1.2099056603773586) internal successors, (513), 387 states have internal predecessors, (513), 102 states have call successors, (102), 21 states have call predecessors, (102), 36 states have return successors, (207), 157 states have call predecessors, (207), 100 states have call successors, (207) [2022-10-16 16:57:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 822 transitions. [2022-10-16 16:57:06,166 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 822 transitions. Word has length 134 [2022-10-16 16:57:06,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:57:06,169 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 822 transitions. [2022-10-16 16:57:06,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 11 states have internal predecessors, (56), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-10-16 16:57:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 822 transitions. [2022-10-16 16:57:06,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-10-16 16:57:06,174 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:57:06,175 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:57:06,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 16:57:06,175 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-10-16 16:57:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:57:06,175 INFO L85 PathProgramCache]: Analyzing trace with hash 845073606, now seen corresponding path program 1 times [2022-10-16 16:57:06,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:57:06,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176525967] [2022-10-16 16:57:06,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:57:06,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:57:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 16:57:09,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 16:57:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 16:57:13,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 16:57:13,775 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 16:57:13,776 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2022-10-16 16:57:13,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2022-10-16 16:57:13,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2022-10-16 16:57:13,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2022-10-16 16:57:13,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2022-10-16 16:57:13,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2022-10-16 16:57:13,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_unlockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2022-10-16 16:57:13,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_unlockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2022-10-16 16:57:13,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2022-10-16 16:57:13,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2022-10-16 16:57:13,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2022-10-16 16:57:13,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2022-10-16 16:57:13,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2022-10-16 16:57:13,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2022-10-16 16:57:13,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2022-10-16 16:57:13,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2022-10-16 16:57:13,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-16 16:57:13,785 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:57:13,790 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 16:57:13,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:57:13 BoogieIcfgContainer [2022-10-16 16:57:13,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 16:57:13,989 INFO L158 Benchmark]: Toolchain (without parser) took 119118.27ms. Allocated memory was 154.1MB in the beginning and 859.8MB in the end (delta: 705.7MB). Free memory was 126.8MB in the beginning and 650.0MB in the end (delta: -523.1MB). Peak memory consumption was 531.2MB. Max. memory is 8.0GB. [2022-10-16 16:57:13,989 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 154.1MB. Free memory was 124.7MB in the beginning and 124.6MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 16:57:13,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.67ms. Allocated memory is still 154.1MB. Free memory was 126.6MB in the beginning and 102.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-10-16 16:57:13,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.13ms. Allocated memory is still 154.1MB. Free memory was 102.7MB in the beginning and 98.7MB in the end (delta: 4.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-16 16:57:13,992 INFO L158 Benchmark]: Boogie Preprocessor took 80.62ms. Allocated memory is still 154.1MB. Free memory was 98.7MB in the beginning and 131.3MB in the end (delta: -32.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-10-16 16:57:13,992 INFO L158 Benchmark]: RCFGBuilder took 2273.39ms. Allocated memory is still 154.1MB. Free memory was 131.3MB in the beginning and 68.9MB in the end (delta: 62.4MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. [2022-10-16 16:57:13,993 INFO L158 Benchmark]: TraceAbstraction took 115929.70ms. Allocated memory was 154.1MB in the beginning and 859.8MB in the end (delta: 705.7MB). Free memory was 68.4MB in the beginning and 650.0MB in the end (delta: -581.6MB). Peak memory consumption was 472.5MB. Max. memory is 8.0GB. [2022-10-16 16:57:13,994 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 154.1MB. Free memory was 124.7MB in the beginning and 124.6MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 736.67ms. Allocated memory is still 154.1MB. Free memory was 126.6MB in the beginning and 102.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 81.13ms. Allocated memory is still 154.1MB. Free memory was 102.7MB in the beginning and 98.7MB in the end (delta: 4.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.62ms. Allocated memory is still 154.1MB. Free memory was 98.7MB in the beginning and 131.3MB in the end (delta: -32.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 2273.39ms. Allocated memory is still 154.1MB. Free memory was 131.3MB in the beginning and 68.9MB in the end (delta: 62.4MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. * TraceAbstraction took 115929.70ms. Allocated memory was 154.1MB in the beginning and 859.8MB in the end (delta: 705.7MB). Free memory was 68.4MB in the beginning and 650.0MB in the end (delta: -581.6MB). Peak memory consumption was 472.5MB. Max. memory is 8.0GB. * 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 - CounterExampleResult [Line: 686]: integer overflow possible integer overflow possible We found a FailurePath: [L540] unsigned char __CS_round = 0; [L541] unsigned char __CS_ret = 0; [L542] const unsigned char __CS_ret_PREEMPTED = 0x01; [L543] const unsigned char __CS_ret_ERROR = 0x02; [L544] const unsigned char __CS_ret_FINISHED = 0x04; [L545] unsigned char __CS_error = 0; [L546] unsigned char __CS_thread_index; [L547] unsigned char __CS_thread_allocated[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L549] void *(*__CS_thread[3 +1])(void *); [L550] unsigned char __CS_thread_status[2][3 +1]; [L551] const unsigned char __THREAD_UNUSED = 0x00; [L552] const unsigned char __THREAD_RUNNING = 0x01; [L553] const unsigned char __THREAD_FINISHED = 0x02; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L674] unsigned char mutex[2]; [L675] int data[2] = {0}; [L680] union __CS__u __CS_u; VAL [__CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L743] unsigned char __CS_cp___CS_thread_status[2][3 +1]; [L744] unsigned char *__CS_cp___CS_thread_lockedon[2][3 +1]; [L745] unsigned char __CS_cp_mutex[2]; [L746] int __CS_cp_data[2]; [L747] int i = 0; VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=0, mutex={7:0}] [L747] COND TRUE i < 2 [L748] int j = 0; VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=0, j=0, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=0, j=1, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=0, j=2, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=0, j=3, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=0, j=4, mutex={7:0}] [L748] COND FALSE !(j < 3 +1) VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=0, j=4, mutex={7:0}] [L752] __CS_cp_mutex[i] = __VERIFIER_nondet_uchar() [L753] __CS_cp_data[i] = __VERIFIER_nondet_int() [L747] ++i VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=1, j=4, mutex={7:0}] [L747] COND TRUE i < 2 [L748] int j = 0; VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=1, j=0, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=1, j=1, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=1, j=2, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=1, j=3, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=1, j=4, mutex={7:0}] [L748] COND FALSE !(j < 3 +1) VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=1, j=4, mutex={7:0}] [L752] __CS_cp_mutex[i] = __VERIFIER_nondet_uchar() [L753] __CS_cp_data[i] = __VERIFIER_nondet_int() [L747] ++i VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=2, j=4, mutex={7:0}] [L747] COND FALSE !(i < 2) VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=2, j=4, mutex={7:0}] [L755] EXPR __CS_cp___CS_thread_status[1][0] [L755] __CS_thread_status[1][0] = __CS_cp___CS_thread_status[1][0] [L756] EXPR __CS_cp___CS_thread_status[1][1] [L756] __CS_thread_status[1][1] = __CS_cp___CS_thread_status[1][1] [L757] EXPR __CS_cp___CS_thread_status[1][2] [L757] __CS_thread_status[1][2] = __CS_cp___CS_thread_status[1][2] [L758] EXPR __CS_cp___CS_thread_status[1][3] [L758] __CS_thread_status[1][3] = __CS_cp___CS_thread_status[1][3] [L759] EXPR __CS_cp___CS_thread_lockedon[1][0] [L759] __CS_thread_lockedon[1][0] = __CS_cp___CS_thread_lockedon[1][0] [L760] EXPR __CS_cp___CS_thread_lockedon[1][1] [L760] __CS_thread_lockedon[1][1] = __CS_cp___CS_thread_lockedon[1][1] [L761] EXPR __CS_cp___CS_thread_lockedon[1][2] [L761] __CS_thread_lockedon[1][2] = __CS_cp___CS_thread_lockedon[1][2] [L762] EXPR __CS_cp___CS_thread_lockedon[1][3] [L762] __CS_thread_lockedon[1][3] = __CS_cp___CS_thread_lockedon[1][3] [L763] EXPR __CS_cp_mutex[1] [L763] mutex[1] = __CS_cp_mutex[1] [L764] EXPR __CS_cp_data[1] [L764] data[1] = __CS_cp_data[1] [L765] __CS_round = 0 [L766] __CS_thread_index = 0 [L767] __CS_thread_born_round[0] = __CS_round [L768] __CS_thread_status[0][0] = __THREAD_RUNNING [L769] __CS_thread[0] = main_thread [L770] __CS_thread_allocated[0] = 1 [L771] EXPR __CS_thread_allocated[0] VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_allocated[0]=1, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=2, j=4, mutex={7:0}] [L771] COND TRUE __CS_thread_allocated[0] == 1 [L772] EXPR __CS_thread_born_round[0] [L772] __CS_round = __CS_thread_born_round[0] [L773] __CS_ret = 0 VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=2, j=4, mutex={7:0}] [L774] CALL __CS_thread[0](0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L722] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=1, mutex={7:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=1, mutex={7:0}] [L562] __CS_round += k [L563] EXPR (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret VAL [(__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret=0, \old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, __VERIFIER_nondet_int()=0, data={8:0}, k=1, mutex={7:0}] [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L722] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}] [L722] COND FALSE !(__CS_ret != 0) [L723] CALL __CS_pthread_mutex_init(&mutex[__CS_round], 0) [L567] return 0; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, \result=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, attr={0:0}, attr={0:0}, data={8:0}, mutex={7:1}, mutex={7:0}, mutex={7:1}] [L723] RET __CS_pthread_mutex_init(&mutex[__CS_round], 0) [L724] unsigned char t1; [L725] unsigned char t2; [L726] unsigned char t3; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}, t1={9:0}, t2={19:0}, t3={21:0}] [L727] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=0, mutex={7:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=0, mutex={7:0}] [L562] __CS_round += k [L563] EXPR (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret VAL [(__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret=0, \old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, __VERIFIER_nondet_int()=0, data={8:0}, k=0, mutex={7:0}] [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L727] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}, t1={9:0}, t2={19:0}, t3={21:0}] [L727] COND FALSE !(__CS_ret != 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}, t1={9:0}, t2={19:0}, t3={21:0}] [L728] CALL __CS_pthread_create(&t1, 0, thread1, 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, attr={0:0}, data={8:0}, id1={9:0}, mutex={7:0}, t1={-1:0}] [L662] COND FALSE !(__CS_thread_index == 3) [L666] __CS_thread_index++ [L667] __CS_thread_allocated[__CS_thread_index] = 1 [L668] __CS_thread_born_round[__CS_thread_index] = __CS_round [L669] __CS_thread[__CS_thread_index] = t1 [L670] __CS_thread_status[__CS_round][__CS_thread_index] = __THREAD_RUNNING [L671] *id1 = __CS_thread_index [L672] return __CS_thread_index; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, \result=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, attr={0:0}, attr={0:0}, data={8:0}, id1={9:0}, id1={9:0}, mutex={7:0}, t1={-1:0}, t1={-1:0}] [L728] RET __CS_pthread_create(&t1, 0, thread1, 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_pthread_create(&t1, 0, thread1, 0)=1, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}, t1={9:0}, t2={19:0}, t3={21:0}] [L729] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=0, mutex={7:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=0, mutex={7:0}] [L562] __CS_round += k [L563] EXPR (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret VAL [(__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret=1, \old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, __VERIFIER_nondet_int()=1, data={8:0}, k=0, mutex={7:0}] [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L729] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}, t1={9:0}, t2={19:0}, t3={21:0}] [L729] COND TRUE __CS_ret != 0 [L729] return 0; [L729] return 0; [L729] return 0; [L729] return 0; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, \result={0:0}, __CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}] [L774] RET __CS_thread[0](0) VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread[0](0)={0:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=2, j=4, mutex={7:0}] [L775] COND FALSE !(__CS_ret!=__CS_ret_PREEMPTED) VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=2, j=4, mutex={7:0}] [L777] EXPR __CS_thread_allocated[1] VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_allocated[1]=1, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=2, j=4, mutex={7:0}] [L777] COND TRUE __CS_thread_allocated[1] == 1 [L778] EXPR __CS_thread_born_round[1] [L778] __CS_round = __CS_thread_born_round[1] [L779] __CS_ret = 0 VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={22:0}, __CS_cp_data={18:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=2, j=4, mutex={7:0}] [L780] CALL __CS_thread[1](0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L683] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=0, mutex={7:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=0, mutex={7:0}] [L562] __CS_round += k [L563] EXPR (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret VAL [(__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret=0, \old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, __VERIFIER_nondet_int()=0, data={8:0}, k=0, mutex={7:0}] [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L683] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}] [L683] COND FALSE !(__CS_ret != 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}] [L684] CALL __CS_pthread_mutex_lock(&mutex[__CS_round]) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, lock={7:1}, mutex={7:0}] [L580] EXPR \read(*lock) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, \read(*lock)=1024, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, lock={7:1}, lock={7:1}, mutex={7:0}] [L580] COND TRUE *lock == 0 [L580] EXPR __CS_thread_index+1 [L580] *lock = (__CS_thread_index+1) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, lock={7:1}, lock={7:1}, mutex={7:0}] [L582] return 0; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, \result=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, lock={7:1}, lock={7:1}, mutex={7:0}] [L684] RET __CS_pthread_mutex_lock(&mutex[__CS_round]) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_pthread_mutex_lock(&mutex[__CS_round])=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}] [L685] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=0, mutex={7:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=0, mutex={7:0}] [L562] __CS_round += k [L563] EXPR (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret VAL [(__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret=0, \old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, __VERIFIER_nondet_int()=0, data={8:0}, k=0, mutex={7:0}] [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L685] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}] [L685] COND FALSE !(__CS_ret != 0) [L686] EXPR data[__CS_round] [L686] data[__CS_round]++ VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, data[__CS_round]=2147483647, data[__CS_round]++=2147483647, mutex={7:0}] - UnprovableResult [Line: 580]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 562]: 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 7 procedures, 192 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 115.7s, OverallIterations: 18, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 58.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17 mSolverCounterUnknown, 3909 SdHoareTripleChecker+Valid, 53.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3817 mSDsluCounter, 10967 SdHoareTripleChecker+Invalid, 52.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7158 mSDsCounter, 2571 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9512 IncrementalHoareTripleChecker+Invalid, 12100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2571 mSolverCounterUnsat, 3809 mSDtfsCounter, 9512 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 841 GetRequests, 631 SyntacticMatches, 2 SemanticMatches, 208 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=637occurred in iteration=13, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 675 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 10.9s SatisfiabilityAnalysisTime, 36.2s InterpolantComputationTime, 1562 NumberOfCodeBlocks, 1510 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1516 ConstructedInterpolants, 0 QuantifiedInterpolants, 12114 SizeOfPredicates, 25 NumberOfNonLiveVariables, 5324 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 27 InterpolantComputations, 14 PerfectInterpolantSequences, 1689/1750 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 proved your program to be incorrect! [2022-10-16 16:57:14,021 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...