/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/02-base_24-malloc_races.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 15:07:06,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 15:07:06,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 15:07:06,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 15:07:06,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 15:07:06,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 15:07:06,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 15:07:06,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 15:07:06,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 15:07:06,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 15:07:06,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 15:07:06,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 15:07:06,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 15:07:06,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 15:07:06,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 15:07:06,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 15:07:06,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 15:07:06,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 15:07:06,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 15:07:06,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 15:07:06,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 15:07:06,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 15:07:06,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 15:07:06,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 15:07:06,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 15:07:06,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 15:07:06,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 15:07:06,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 15:07:06,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 15:07:06,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 15:07:06,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 15:07:06,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 15:07:06,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 15:07:06,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 15:07:06,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 15:07:06,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 15:07:06,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 15:07:06,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 15:07:06,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 15:07:06,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 15:07:06,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 15:07:06,545 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-15 15:07:06,559 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 15:07:06,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 15:07:06,559 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 15:07:06,560 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 15:07:06,560 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 15:07:06,560 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 15:07:06,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 15:07:06,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 15:07:06,561 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 15:07:06,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 15:07:06,561 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 15:07:06,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 15:07:06,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 15:07:06,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 15:07:06,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 15:07:06,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 15:07:06,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 15:07:06,562 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 15:07:06,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 15:07:06,562 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 15:07:06,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 15:07:06,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 15:07:06,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 15:07:06,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 15:07:06,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 15:07:06,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 15:07:06,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 15:07:06,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 15:07:06,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 15:07:06,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 15:07:06,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 15:07:06,563 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 15:07:06,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 15:07:06,563 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-15 15:07:06,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 15:07:06,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 15:07:06,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 15:07:06,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 15:07:06,782 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 15:07:06,783 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/02-base_24-malloc_races.i [2022-03-15 15:07:06,830 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c66184b/1f8caa90ab3a452c885436a5f67dfef1/FLAG0b7c31171 [2022-03-15 15:07:07,256 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 15:07:07,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/02-base_24-malloc_races.i [2022-03-15 15:07:07,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c66184b/1f8caa90ab3a452c885436a5f67dfef1/FLAG0b7c31171 [2022-03-15 15:07:07,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c66184b/1f8caa90ab3a452c885436a5f67dfef1 [2022-03-15 15:07:07,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 15:07:07,577 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 15:07:07,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 15:07:07,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 15:07:07,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 15:07:07,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:07:07" (1/1) ... [2022-03-15 15:07:07,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c7e095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:07:07, skipping insertion in model container [2022-03-15 15:07:07,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:07:07" (1/1) ... [2022-03-15 15:07:07,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 15:07:07,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 15:07:08,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 15:07:08,059 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 15:07:08,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 15:07:08,156 INFO L208 MainTranslator]: Completed translation [2022-03-15 15:07:08,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:07:08 WrapperNode [2022-03-15 15:07:08,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 15:07:08,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 15:07:08,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 15:07:08,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 15:07:08,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:07:08" (1/1) ... [2022-03-15 15:07:08,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:07:08" (1/1) ... [2022-03-15 15:07:08,206 INFO L137 Inliner]: procedures = 365, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 74 [2022-03-15 15:07:08,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 15:07:08,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 15:07:08,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 15:07:08,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 15:07:08,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:07:08" (1/1) ... [2022-03-15 15:07:08,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:07:08" (1/1) ... [2022-03-15 15:07:08,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:07:08" (1/1) ... [2022-03-15 15:07:08,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:07:08" (1/1) ... [2022-03-15 15:07:08,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:07:08" (1/1) ... [2022-03-15 15:07:08,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:07:08" (1/1) ... [2022-03-15 15:07:08,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:07:08" (1/1) ... [2022-03-15 15:07:08,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 15:07:08,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 15:07:08,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 15:07:08,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 15:07:08,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:07:08" (1/1) ... [2022-03-15 15:07:08,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 15:07:08,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:07:08,276 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-03-15 15:07:08,294 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-03-15 15:07:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 15:07:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 15:07:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 15:07:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 15:07:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 15:07:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 15:07:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 15:07:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 15:07:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 15:07:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 15:07:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 15:07:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 15:07:08,306 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 15:07:08,442 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 15:07:08,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 15:07:08,611 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 15:07:08,616 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 15:07:08,616 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 15:07:08,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:07:08 BoogieIcfgContainer [2022-03-15 15:07:08,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 15:07:08,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 15:07:08,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 15:07:08,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 15:07:08,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 03:07:07" (1/3) ... [2022-03-15 15:07:08,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40353af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:07:08, skipping insertion in model container [2022-03-15 15:07:08,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:07:08" (2/3) ... [2022-03-15 15:07:08,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40353af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:07:08, skipping insertion in model container [2022-03-15 15:07:08,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:07:08" (3/3) ... [2022-03-15 15:07:08,625 INFO L111 eAbstractionObserver]: Analyzing ICFG 02-base_24-malloc_races.i [2022-03-15 15:07:08,629 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 15:07:08,629 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 15:07:08,629 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-03-15 15:07:08,629 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 15:07:08,674 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,674 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,674 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,674 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,674 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,674 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,675 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,675 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,676 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,676 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,676 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,676 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,676 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,677 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,677 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,677 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,677 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,677 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,678 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,678 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,678 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,679 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,679 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,679 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,679 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,679 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,680 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,680 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,680 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,680 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,680 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,683 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,683 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,683 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,683 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,683 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,683 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,686 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,686 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,686 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,687 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,687 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,687 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,687 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:07:08,689 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 15:07:08,718 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 15:07:08,722 INFO L339 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, mLazyFiniteAutomaton=false, 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, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 15:07:08,723 INFO L340 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-03-15 15:07:08,732 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 118 places, 114 transitions, 233 flow [2022-03-15 15:07:08,817 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1124 states, 1098 states have (on average 1.9426229508196722) internal successors, (2133), 1123 states have internal predecessors, (2133), 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-03-15 15:07:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 1124 states, 1098 states have (on average 1.9426229508196722) internal successors, (2133), 1123 states have internal predecessors, (2133), 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-03-15 15:07:08,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 15:07:08,825 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:07:08,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:07:08,826 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 15:07:08,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:07:08,833 INFO L85 PathProgramCache]: Analyzing trace with hash -796788612, now seen corresponding path program 1 times [2022-03-15 15:07:08,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:07:08,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208806351] [2022-03-15 15:07:08,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:07:08,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:07:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:07:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:07:09,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:07:09,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208806351] [2022-03-15 15:07:09,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208806351] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:07:09,060 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:07:09,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 15:07:09,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197839113] [2022-03-15 15:07:09,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:07:09,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:07:09,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:07:09,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:07:09,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:07:09,097 INFO L87 Difference]: Start difference. First operand has 1124 states, 1098 states have (on average 1.9426229508196722) internal successors, (2133), 1123 states have internal predecessors, (2133), 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) Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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-03-15 15:07:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:07:09,162 INFO L93 Difference]: Finished difference Result 1123 states and 2132 transitions. [2022-03-15 15:07:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:07:09,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 33 [2022-03-15 15:07:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:07:09,188 INFO L225 Difference]: With dead ends: 1123 [2022-03-15 15:07:09,191 INFO L226 Difference]: Without dead ends: 1123 [2022-03-15 15:07:09,192 INFO L932 BasicCegarLoop]: 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-03-15 15:07:09,196 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 2 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:07:09,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 209 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:07:09,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-03-15 15:07:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2022-03-15 15:07:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1098 states have (on average 1.941712204007286) internal successors, (2132), 1122 states have internal predecessors, (2132), 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-03-15 15:07:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 2132 transitions. [2022-03-15 15:07:09,284 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 2132 transitions. Word has length 33 [2022-03-15 15:07:09,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:07:09,285 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 2132 transitions. [2022-03-15 15:07:09,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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-03-15 15:07:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 2132 transitions. [2022-03-15 15:07:09,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-15 15:07:09,286 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:07:09,286 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:07:09,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 15:07:09,286 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 15:07:09,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:07:09,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1918488513, now seen corresponding path program 1 times [2022-03-15 15:07:09,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:07:09,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231338733] [2022-03-15 15:07:09,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:07:09,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:07:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:07:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:07:09,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:07:09,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231338733] [2022-03-15 15:07:09,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231338733] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:07:09,373 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:07:09,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 15:07:09,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75411988] [2022-03-15 15:07:09,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:07:09,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:07:09,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:07:09,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:07:09,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:07:09,375 INFO L87 Difference]: Start difference. First operand 1123 states and 2132 transitions. Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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-03-15 15:07:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:07:09,400 INFO L93 Difference]: Finished difference Result 1122 states and 2131 transitions. [2022-03-15 15:07:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:07:09,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2022-03-15 15:07:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:07:09,404 INFO L225 Difference]: With dead ends: 1122 [2022-03-15 15:07:09,404 INFO L226 Difference]: Without dead ends: 1122 [2022-03-15 15:07:09,404 INFO L932 BasicCegarLoop]: 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-03-15 15:07:09,405 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:07:09,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 207 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:07:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-03-15 15:07:09,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2022-03-15 15:07:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1098 states have (on average 1.9408014571948997) internal successors, (2131), 1121 states have internal predecessors, (2131), 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-03-15 15:07:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 2131 transitions. [2022-03-15 15:07:09,430 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 2131 transitions. Word has length 40 [2022-03-15 15:07:09,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:07:09,430 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 2131 transitions. [2022-03-15 15:07:09,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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-03-15 15:07:09,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 2131 transitions. [2022-03-15 15:07:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-15 15:07:09,443 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:07:09,443 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:07:09,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 15:07:09,443 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 15:07:09,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:07:09,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2011316591, now seen corresponding path program 1 times [2022-03-15 15:07:09,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:07:09,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405884146] [2022-03-15 15:07:09,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:07:09,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:07:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:07:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:07:09,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:07:09,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405884146] [2022-03-15 15:07:09,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405884146] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:07:09,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:07:09,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 15:07:09,503 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120212107] [2022-03-15 15:07:09,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:07:09,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:07:09,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:07:09,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:07:09,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:07:09,504 INFO L87 Difference]: Start difference. First operand 1122 states and 2131 transitions. Second operand has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 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-03-15 15:07:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:07:09,561 INFO L93 Difference]: Finished difference Result 1056 states and 2001 transitions. [2022-03-15 15:07:09,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:07:09,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2022-03-15 15:07:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:07:09,565 INFO L225 Difference]: With dead ends: 1056 [2022-03-15 15:07:09,565 INFO L226 Difference]: Without dead ends: 1056 [2022-03-15 15:07:09,565 INFO L932 BasicCegarLoop]: 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-03-15 15:07:09,566 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 61 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:07:09,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 167 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:07:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-03-15 15:07:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1056. [2022-03-15 15:07:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1041 states have (on average 1.9221902017291066) internal successors, (2001), 1055 states have internal predecessors, (2001), 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-03-15 15:07:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 2001 transitions. [2022-03-15 15:07:09,585 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 2001 transitions. Word has length 51 [2022-03-15 15:07:09,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:07:09,586 INFO L470 AbstractCegarLoop]: Abstraction has 1056 states and 2001 transitions. [2022-03-15 15:07:09,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 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-03-15 15:07:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 2001 transitions. [2022-03-15 15:07:09,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-15 15:07:09,587 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:07:09,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:07:09,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 15:07:09,588 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 15:07:09,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:07:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash -576174563, now seen corresponding path program 1 times [2022-03-15 15:07:09,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:07:09,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038179288] [2022-03-15 15:07:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:07:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:07:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:07:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:07:09,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:07:09,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038179288] [2022-03-15 15:07:09,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038179288] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:07:09,755 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:07:09,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:07:09,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673491865] [2022-03-15 15:07:09,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:07:09,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:07:09,756 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:07:09,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:07:09,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:07:09,757 INFO L87 Difference]: Start difference. First operand 1056 states and 2001 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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-03-15 15:07:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:07:10,082 INFO L93 Difference]: Finished difference Result 1247 states and 2370 transitions. [2022-03-15 15:07:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:07:10,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 58 [2022-03-15 15:07:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:07:10,088 INFO L225 Difference]: With dead ends: 1247 [2022-03-15 15:07:10,088 INFO L226 Difference]: Without dead ends: 1247 [2022-03-15 15:07:10,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:07:10,089 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 104 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:07:10,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 612 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:07:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2022-03-15 15:07:10,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1160. [2022-03-15 15:07:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1145 states have (on average 1.931004366812227) internal successors, (2211), 1159 states have internal predecessors, (2211), 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-03-15 15:07:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 2211 transitions. [2022-03-15 15:07:10,118 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 2211 transitions. Word has length 58 [2022-03-15 15:07:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:07:10,118 INFO L470 AbstractCegarLoop]: Abstraction has 1160 states and 2211 transitions. [2022-03-15 15:07:10,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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-03-15 15:07:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 2211 transitions. [2022-03-15 15:07:10,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-15 15:07:10,120 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:07:10,120 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:07:10,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 15:07:10,120 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 15:07:10,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:07:10,121 INFO L85 PathProgramCache]: Analyzing trace with hash -906441389, now seen corresponding path program 1 times [2022-03-15 15:07:10,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:07:10,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473210445] [2022-03-15 15:07:10,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:07:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:07:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:07:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:07:10,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:07:10,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473210445] [2022-03-15 15:07:10,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473210445] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:07:10,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:07:10,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:07:10,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010356346] [2022-03-15 15:07:10,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:07:10,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:07:10,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:07:10,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:07:10,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:07:10,206 INFO L87 Difference]: Start difference. First operand 1160 states and 2211 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 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-03-15 15:07:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:07:10,401 INFO L93 Difference]: Finished difference Result 1930 states and 3682 transitions. [2022-03-15 15:07:10,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:07:10,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 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 59 [2022-03-15 15:07:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:07:10,407 INFO L225 Difference]: With dead ends: 1930 [2022-03-15 15:07:10,407 INFO L226 Difference]: Without dead ends: 1930 [2022-03-15 15:07:10,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:07:10,408 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 171 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:07:10,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 423 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:07:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2022-03-15 15:07:10,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1231. [2022-03-15 15:07:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1216 states have (on average 1.9317434210526316) internal successors, (2349), 1230 states have internal predecessors, (2349), 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-03-15 15:07:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 2349 transitions. [2022-03-15 15:07:10,433 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 2349 transitions. Word has length 59 [2022-03-15 15:07:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:07:10,433 INFO L470 AbstractCegarLoop]: Abstraction has 1231 states and 2349 transitions. [2022-03-15 15:07:10,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 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-03-15 15:07:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 2349 transitions. [2022-03-15 15:07:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-15 15:07:10,435 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:07:10,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:07:10,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 15:07:10,435 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 15:07:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:07:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2126821387, now seen corresponding path program 1 times [2022-03-15 15:07:10,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:07:10,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368189115] [2022-03-15 15:07:10,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:07:10,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:07:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:07:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:07:10,477 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:07:10,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368189115] [2022-03-15 15:07:10,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368189115] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:07:10,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:07:10,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 15:07:10,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697175432] [2022-03-15 15:07:10,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:07:10,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:07:10,478 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:07:10,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:07:10,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:07:10,479 INFO L87 Difference]: Start difference. First operand 1231 states and 2349 transitions. Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 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-03-15 15:07:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:07:10,489 INFO L93 Difference]: Finished difference Result 1159 states and 2207 transitions. [2022-03-15 15:07:10,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:07:10,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-03-15 15:07:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:07:10,493 INFO L225 Difference]: With dead ends: 1159 [2022-03-15 15:07:10,493 INFO L226 Difference]: Without dead ends: 1159 [2022-03-15 15:07:10,493 INFO L932 BasicCegarLoop]: 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-03-15 15:07:10,494 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:07:10,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:07:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-03-15 15:07:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2022-03-15 15:07:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1151 states have (on average 1.9174630755864466) internal successors, (2207), 1158 states have internal predecessors, (2207), 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-03-15 15:07:10,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 2207 transitions. [2022-03-15 15:07:10,511 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 2207 transitions. Word has length 61 [2022-03-15 15:07:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:07:10,511 INFO L470 AbstractCegarLoop]: Abstraction has 1159 states and 2207 transitions. [2022-03-15 15:07:10,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 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-03-15 15:07:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 2207 transitions. [2022-03-15 15:07:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-03-15 15:07:10,513 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:07:10,513 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:07:10,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 15:07:10,513 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 15:07:10,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:07:10,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1999581971, now seen corresponding path program 1 times [2022-03-15 15:07:10,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:07:10,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768994565] [2022-03-15 15:07:10,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:07:10,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:07:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:07:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:07:10,545 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:07:10,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768994565] [2022-03-15 15:07:10,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768994565] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:07:10,545 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:07:10,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 15:07:10,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108753184] [2022-03-15 15:07:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:07:10,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:07:10,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:07:10,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:07:10,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:07:10,546 INFO L87 Difference]: Start difference. First operand 1159 states and 2207 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-03-15 15:07:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:07:10,557 INFO L93 Difference]: Finished difference Result 719 states and 1291 transitions. [2022-03-15 15:07:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:07:10,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2022-03-15 15:07:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:07:10,560 INFO L225 Difference]: With dead ends: 719 [2022-03-15 15:07:10,560 INFO L226 Difference]: Without dead ends: 719 [2022-03-15 15:07:10,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-03-15 15:07:10,561 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 47 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:07:10,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 186 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:07:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-03-15 15:07:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2022-03-15 15:07:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 713 states have (on average 1.8106591865357644) internal successors, (1291), 718 states have internal predecessors, (1291), 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-03-15 15:07:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1291 transitions. [2022-03-15 15:07:10,570 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1291 transitions. Word has length 67 [2022-03-15 15:07:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:07:10,571 INFO L470 AbstractCegarLoop]: Abstraction has 719 states and 1291 transitions. [2022-03-15 15:07:10,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-03-15 15:07:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1291 transitions. [2022-03-15 15:07:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-15 15:07:10,572 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:07:10,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:07:10,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 15:07:10,572 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 15:07:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:07:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2062702493, now seen corresponding path program 1 times [2022-03-15 15:07:10,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:07:10,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779394793] [2022-03-15 15:07:10,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:07:10,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:07:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:07:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:07:10,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:07:10,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779394793] [2022-03-15 15:07:10,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779394793] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:07:10,638 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:07:10,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:07:10,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288623049] [2022-03-15 15:07:10,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:07:10,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:07:10,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:07:10,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:07:10,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:07:10,639 INFO L87 Difference]: Start difference. First operand 719 states and 1291 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-03-15 15:07:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:07:10,749 INFO L93 Difference]: Finished difference Result 838 states and 1502 transitions. [2022-03-15 15:07:10,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:07:10,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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 68 [2022-03-15 15:07:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:07:10,751 INFO L225 Difference]: With dead ends: 838 [2022-03-15 15:07:10,751 INFO L226 Difference]: Without dead ends: 638 [2022-03-15 15:07:10,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:07:10,752 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 76 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:07:10,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 316 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:07:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-03-15 15:07:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 596. [2022-03-15 15:07:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 591 states have (on average 1.754653130287648) internal successors, (1037), 595 states have internal predecessors, (1037), 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-03-15 15:07:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1037 transitions. [2022-03-15 15:07:10,761 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1037 transitions. Word has length 68 [2022-03-15 15:07:10,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:07:10,761 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 1037 transitions. [2022-03-15 15:07:10,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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-03-15 15:07:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1037 transitions. [2022-03-15 15:07:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-15 15:07:10,761 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:07:10,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:07:10,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 15:07:10,762 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 15:07:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:07:10,762 INFO L85 PathProgramCache]: Analyzing trace with hash 283971730, now seen corresponding path program 1 times [2022-03-15 15:07:10,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:07:10,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553406212] [2022-03-15 15:07:10,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:07:10,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:07:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:07:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:07:10,827 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:07:10,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553406212] [2022-03-15 15:07:10,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553406212] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:07:10,827 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:07:10,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:07:10,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218009994] [2022-03-15 15:07:10,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:07:10,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:07:10,828 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:07:10,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:07:10,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:07:10,829 INFO L87 Difference]: Start difference. First operand 596 states and 1037 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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-03-15 15:07:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:07:10,964 INFO L93 Difference]: Finished difference Result 806 states and 1382 transitions. [2022-03-15 15:07:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:07:10,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 70 [2022-03-15 15:07:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:07:10,966 INFO L225 Difference]: With dead ends: 806 [2022-03-15 15:07:10,966 INFO L226 Difference]: Without dead ends: 635 [2022-03-15 15:07:10,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:07:10,967 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 107 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:07:10,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 417 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:07:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-03-15 15:07:10,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 506. [2022-03-15 15:07:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 501 states have (on average 1.7524950099800398) internal successors, (878), 505 states have internal predecessors, (878), 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-03-15 15:07:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 878 transitions. [2022-03-15 15:07:10,978 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 878 transitions. Word has length 70 [2022-03-15 15:07:10,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:07:10,978 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 878 transitions. [2022-03-15 15:07:10,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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-03-15 15:07:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 878 transitions. [2022-03-15 15:07:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-15 15:07:10,988 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:07:10,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:07:10,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 15:07:10,988 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 15:07:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:07:10,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1676342582, now seen corresponding path program 1 times [2022-03-15 15:07:10,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:07:10,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456271017] [2022-03-15 15:07:10,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:07:10,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:07:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:07:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:07:11,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:07:11,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456271017] [2022-03-15 15:07:11,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456271017] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:07:11,121 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:07:11,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:07:11,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734983249] [2022-03-15 15:07:11,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:07:11,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:07:11,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:07:11,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:07:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:07:11,122 INFO L87 Difference]: Start difference. First operand 506 states and 878 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 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-03-15 15:07:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:07:11,450 INFO L93 Difference]: Finished difference Result 588 states and 994 transitions. [2022-03-15 15:07:11,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 15:07:11,450 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 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 78 [2022-03-15 15:07:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:07:11,452 INFO L225 Difference]: With dead ends: 588 [2022-03-15 15:07:11,452 INFO L226 Difference]: Without dead ends: 588 [2022-03-15 15:07:11,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2022-03-15 15:07:11,453 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 234 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:07:11,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 659 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:07:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-03-15 15:07:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 448. [2022-03-15 15:07:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 444 states have (on average 1.7297297297297298) internal successors, (768), 447 states have internal predecessors, (768), 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-03-15 15:07:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 768 transitions. [2022-03-15 15:07:11,460 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 768 transitions. Word has length 78 [2022-03-15 15:07:11,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:07:11,461 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 768 transitions. [2022-03-15 15:07:11,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 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-03-15 15:07:11,461 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 768 transitions. [2022-03-15 15:07:11,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-15 15:07:11,461 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:07:11,461 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:07:11,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 15:07:11,462 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 15:07:11,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:07:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash -248821663, now seen corresponding path program 1 times [2022-03-15 15:07:11,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:07:11,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117271426] [2022-03-15 15:07:11,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:07:11,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:07:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:07:11,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:07:11,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:07:11,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117271426] [2022-03-15 15:07:11,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117271426] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:07:11,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:07:11,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 15:07:11,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775269252] [2022-03-15 15:07:11,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:07:11,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 15:07:11,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:07:11,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 15:07:11,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:07:11,587 INFO L87 Difference]: Start difference. First operand 448 states and 768 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 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-03-15 15:07:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:07:11,859 INFO L93 Difference]: Finished difference Result 436 states and 745 transitions. [2022-03-15 15:07:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 15:07:11,859 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 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 78 [2022-03-15 15:07:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:07:11,861 INFO L225 Difference]: With dead ends: 436 [2022-03-15 15:07:11,861 INFO L226 Difference]: Without dead ends: 404 [2022-03-15 15:07:11,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2022-03-15 15:07:11,862 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 150 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:07:11,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 681 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:07:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-03-15 15:07:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 388. [2022-03-15 15:07:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 385 states have (on average 1.716883116883117) internal successors, (661), 387 states have internal predecessors, (661), 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-03-15 15:07:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 661 transitions. [2022-03-15 15:07:11,870 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 661 transitions. Word has length 78 [2022-03-15 15:07:11,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:07:11,870 INFO L470 AbstractCegarLoop]: Abstraction has 388 states and 661 transitions. [2022-03-15 15:07:11,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 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-03-15 15:07:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 661 transitions. [2022-03-15 15:07:11,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-15 15:07:11,871 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:07:11,871 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:07:11,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 15:07:11,872 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 15:07:11,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:07:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash 772850320, now seen corresponding path program 1 times [2022-03-15 15:07:11,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:07:11,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741435535] [2022-03-15 15:07:11,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:07:11,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:07:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 15:07:11,904 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 15:07:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 15:07:11,955 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 15:07:11,955 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 15:07:11,956 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2022-03-15 15:07:11,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2022-03-15 15:07:11,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2022-03-15 15:07:11,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2022-03-15 15:07:11,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2022-03-15 15:07:11,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2022-03-15 15:07:11,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (8 of 15 remaining) [2022-03-15 15:07:11,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2022-03-15 15:07:11,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2022-03-15 15:07:11,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2022-03-15 15:07:11,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2022-03-15 15:07:11,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2022-03-15 15:07:11,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2022-03-15 15:07:11,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2022-03-15 15:07:11,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2022-03-15 15:07:11,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 15:07:11,960 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:07:11,964 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 15:07:11,964 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 15:07:12,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 03:07:12 BasicIcfg [2022-03-15 15:07:12,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 15:07:12,018 INFO L158 Benchmark]: Toolchain (without parser) took 4441.73ms. Allocated memory was 225.4MB in the beginning and 312.5MB in the end (delta: 87.0MB). Free memory was 172.9MB in the beginning and 117.4MB in the end (delta: 55.6MB). Peak memory consumption was 144.3MB. Max. memory is 8.0GB. [2022-03-15 15:07:12,018 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 225.4MB. Free memory is still 191.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 15:07:12,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.74ms. Allocated memory is still 225.4MB. Free memory was 172.8MB in the beginning and 175.4MB in the end (delta: -2.6MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-03-15 15:07:12,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.32ms. Allocated memory is still 225.4MB. Free memory was 175.4MB in the beginning and 172.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 15:07:12,019 INFO L158 Benchmark]: Boogie Preprocessor took 28.90ms. Allocated memory is still 225.4MB. Free memory was 172.8MB in the beginning and 171.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 15:07:12,019 INFO L158 Benchmark]: RCFGBuilder took 381.25ms. Allocated memory is still 225.4MB. Free memory was 171.2MB in the beginning and 156.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-03-15 15:07:12,019 INFO L158 Benchmark]: TraceAbstraction took 3398.81ms. Allocated memory was 225.4MB in the beginning and 312.5MB in the end (delta: 87.0MB). Free memory was 156.0MB in the beginning and 117.4MB in the end (delta: 38.7MB). Peak memory consumption was 127.3MB. Max. memory is 8.0GB. [2022-03-15 15:07:12,020 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.09ms. Allocated memory is still 225.4MB. Free memory is still 191.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 577.74ms. Allocated memory is still 225.4MB. Free memory was 172.8MB in the beginning and 175.4MB in the end (delta: -2.6MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.32ms. Allocated memory is still 225.4MB. Free memory was 175.4MB in the beginning and 172.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.90ms. Allocated memory is still 225.4MB. Free memory was 172.8MB in the beginning and 171.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 381.25ms. Allocated memory is still 225.4MB. Free memory was 171.2MB in the beginning and 156.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 3398.81ms. Allocated memory was 225.4MB in the beginning and 312.5MB in the end (delta: 87.0MB). Free memory was 156.0MB in the beginning and 117.4MB in the end (delta: 38.7MB). Peak memory consumption was 127.3MB. 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 - DataRaceFoundResult [Line: 1241]: Data race detected Data race detected The following path leads to a data race: [L1223] 0 int *x; VAL [x={0:0}] [L1224] 0 int *y; VAL [x={0:0}, y={0:0}] [L1225] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [m={3:0}, x={0:0}, y={0:0}] [L1234] 0 pthread_t id; VAL [id={5:0}, m={3:0}, x={0:0}, y={0:0}] [L1235] 0 x = malloc(sizeof(int)) VAL [id={5:0}, m={3:0}, malloc(sizeof(int))={-2:0}, x={-2:0}, x = malloc(sizeof(int))=103, y={0:0}] [L1236] 0 y = malloc(sizeof(int)) VAL [id={5:0}, m={3:0}, malloc(sizeof(int))={-3:0}, x={-2:0}, y={-3:0}, y = malloc(sizeof(int))=104] [L1237] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, id={5:0}, m={3:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1, x={-2:0}, y={-3:0}] [L1239] EXPR 0 *x VAL [arg={0:0}, arg={0:0}, id={5:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1239] EXPR 0 \read(*x) VAL [\read(*x)=106, arg={0:0}, arg={0:0}, id={5:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1239] 0 printf("%d\n",*x) VAL [\read(*x)=106, arg={0:0}, arg={0:0}, id={5:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1228] EXPR 1 *x VAL [arg={0:0}, arg={0:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1228] 1 *x = 3 VAL [arg={0:0}, arg={0:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1241] EXPR 0 *y VAL [arg={0:0}, arg={0:0}, id={5:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1241] EXPR 0 \read(*y) VAL [\read(*y)=101, arg={0:0}, arg={0:0}, id={5:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1229] EXPR 1 *y VAL [arg={0:0}, arg={0:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1229] 1 *y = 8 VAL [*y = 8=102, arg={0:0}, arg={0:0}, m={3:0}, x={-2:0}, y={-3:0}] [L1241] 0 printf("%d\n",*y) VAL [*y = 8=102, \read(*y)=101, arg={0:0}, arg={0:0}, id={5:0}, m={3:0}, x={-2:0}, y={-3:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: *x = 3 [1228] * C: *x = 3 [1228] * C: y = malloc(sizeof(int)) [1236] * C: *y = 8 [1229] * C: *x = 3 [1228] * C: *x = 3 [1228] * C: x = malloc(sizeof(int)) [1235] and C: printf("%d\n",*y) [1241] - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1236]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 147 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1013 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1013 mSDsluCounter, 4088 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2689 mSDsCounter, 209 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1732 IncrementalHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 209 mSolverCounterUnsat, 1415 mSDtfsCounter, 1732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1231occurred in iteration=5, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1113 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 652 ConstructedInterpolants, 0 QuantifiedInterpolants, 1514 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-03-15 15:07:12,124 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...