/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-4b0ab11 [2022-03-03 18:20:09,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 18:20:09,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 18:20:09,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 18:20:09,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 18:20:09,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 18:20:09,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 18:20:09,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 18:20:09,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 18:20:09,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 18:20:09,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 18:20:09,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 18:20:09,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 18:20:09,316 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 18:20:09,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 18:20:09,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 18:20:09,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 18:20:09,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 18:20:09,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 18:20:09,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 18:20:09,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 18:20:09,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 18:20:09,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 18:20:09,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 18:20:09,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 18:20:09,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 18:20:09,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 18:20:09,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 18:20:09,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 18:20:09,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 18:20:09,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 18:20:09,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 18:20:09,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 18:20:09,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 18:20:09,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 18:20:09,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 18:20:09,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 18:20:09,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 18:20:09,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 18:20:09,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 18:20:09,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 18:20:09,352 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-03 18:20:09,389 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 18:20:09,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 18:20:09,390 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 18:20:09,390 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 18:20:09,391 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 18:20:09,391 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 18:20:09,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 18:20:09,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 18:20:09,392 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 18:20:09,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 18:20:09,393 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 18:20:09,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 18:20:09,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 18:20:09,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 18:20:09,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 18:20:09,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 18:20:09,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 18:20:09,393 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 18:20:09,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 18:20:09,394 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 18:20:09,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 18:20:09,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 18:20:09,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 18:20:09,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 18:20:09,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 18:20:09,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 18:20:09,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 18:20:09,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 18:20:09,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 18:20:09,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 18:20:09,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 18:20:09,395 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 18:20:09,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 18:20:09,395 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-03 18:20:09,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 18:20:09,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 18:20:09,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 18:20:09,600 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 18:20:09,600 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 18:20:09,601 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-03 18:20:09,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28109c105/81881a1fd5334bcb97278448ced72eba/FLAGeb5775f82 [2022-03-03 18:20:10,071 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 18:20:10,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/02-base_24-malloc_races.i [2022-03-03 18:20:10,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28109c105/81881a1fd5334bcb97278448ced72eba/FLAGeb5775f82 [2022-03-03 18:20:10,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28109c105/81881a1fd5334bcb97278448ced72eba [2022-03-03 18:20:10,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 18:20:10,418 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 18:20:10,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 18:20:10,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 18:20:10,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 18:20:10,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:20:10" (1/1) ... [2022-03-03 18:20:10,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b1f721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:10, skipping insertion in model container [2022-03-03 18:20:10,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:20:10" (1/1) ... [2022-03-03 18:20:10,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 18:20:10,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 18:20:10,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 18:20:10,920 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 18:20:10,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 18:20:11,028 INFO L208 MainTranslator]: Completed translation [2022-03-03 18:20:11,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:11 WrapperNode [2022-03-03 18:20:11,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 18:20:11,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 18:20:11,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 18:20:11,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 18:20:11,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:11" (1/1) ... [2022-03-03 18:20:11,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:11" (1/1) ... [2022-03-03 18:20:11,080 INFO L137 Inliner]: procedures = 365, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 74 [2022-03-03 18:20:11,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 18:20:11,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 18:20:11,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 18:20:11,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 18:20:11,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:11" (1/1) ... [2022-03-03 18:20:11,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:11" (1/1) ... [2022-03-03 18:20:11,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:11" (1/1) ... [2022-03-03 18:20:11,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:11" (1/1) ... [2022-03-03 18:20:11,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:11" (1/1) ... [2022-03-03 18:20:11,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:11" (1/1) ... [2022-03-03 18:20:11,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:11" (1/1) ... [2022-03-03 18:20:11,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 18:20:11,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 18:20:11,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 18:20:11,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 18:20:11,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:11" (1/1) ... [2022-03-03 18:20:11,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 18:20:11,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:20:11,137 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-03 18:20:11,146 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-03 18:20:11,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 18:20:11,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 18:20:11,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 18:20:11,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 18:20:11,169 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-03 18:20:11,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-03 18:20:11,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 18:20:11,169 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-03 18:20:11,169 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-03 18:20:11,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 18:20:11,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 18:20:11,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 18:20:11,170 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 18:20:11,283 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 18:20:11,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 18:20:11,482 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 18:20:11,488 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 18:20:11,488 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-03 18:20:11,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 06:20:11 BoogieIcfgContainer [2022-03-03 18:20:11,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 18:20:11,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 18:20:11,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 18:20:11,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 18:20:11,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:20:10" (1/3) ... [2022-03-03 18:20:11,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38255310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:20:11, skipping insertion in model container [2022-03-03 18:20:11,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:11" (2/3) ... [2022-03-03 18:20:11,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38255310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:20:11, skipping insertion in model container [2022-03-03 18:20:11,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 06:20:11" (3/3) ... [2022-03-03 18:20:11,503 INFO L111 eAbstractionObserver]: Analyzing ICFG 02-base_24-malloc_races.i [2022-03-03 18:20:11,507 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 18:20:11,507 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 18:20:11,508 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-03-03 18:20:11,508 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 18:20:11,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,544 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,544 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,544 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,544 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,545 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,545 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,545 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,545 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,548 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,548 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,548 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,550 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,550 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,550 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,552 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,552 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,552 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,552 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,553 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,553 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,553 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,554 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,554 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,554 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,555 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,555 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,555 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,555 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,556 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,556 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,559 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,560 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,560 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,560 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,560 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,560 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,560 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:11,562 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-03 18:20:11,598 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 18:20:11,603 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-03 18:20:11,603 INFO L340 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-03-03 18:20:11,613 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 118 places, 114 transitions, 233 flow [2022-03-03 18:20:11,711 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-03 18:20:11,717 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-03 18:20:11,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-03 18:20:11,723 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:20:11,724 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-03 18:20:11,725 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-03 18:20:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:20:11,729 INFO L85 PathProgramCache]: Analyzing trace with hash -796788612, now seen corresponding path program 1 times [2022-03-03 18:20:11,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:20:11,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944107696] [2022-03-03 18:20:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:20:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:20:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:20:11,990 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-03 18:20:11,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:20:11,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944107696] [2022-03-03 18:20:11,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944107696] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:20:11,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:20:11,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 18:20:11,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096773582] [2022-03-03 18:20:11,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:20:11,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:20:11,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:20:12,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:20:12,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:20:12,037 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-03 18:20:12,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:20:12,119 INFO L93 Difference]: Finished difference Result 1123 states and 2132 transitions. [2022-03-03 18:20:12,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:20:12,121 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-03 18:20:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:20:12,143 INFO L225 Difference]: With dead ends: 1123 [2022-03-03 18:20:12,145 INFO L226 Difference]: Without dead ends: 1123 [2022-03-03 18:20:12,147 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-03 18:20:12,154 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-03 18:20:12,161 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-03 18:20:12,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-03-03 18:20:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2022-03-03 18:20:12,252 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-03 18:20:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 2132 transitions. [2022-03-03 18:20:12,256 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 2132 transitions. Word has length 33 [2022-03-03 18:20:12,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:20:12,257 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 2132 transitions. [2022-03-03 18:20:12,257 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-03 18:20:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 2132 transitions. [2022-03-03 18:20:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-03 18:20:12,258 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:20:12,258 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-03 18:20:12,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 18:20:12,258 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-03 18:20:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:20:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1918488513, now seen corresponding path program 1 times [2022-03-03 18:20:12,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:20:12,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878276348] [2022-03-03 18:20:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:20:12,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:20:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:20:12,331 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-03 18:20:12,331 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:20:12,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878276348] [2022-03-03 18:20:12,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878276348] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:20:12,332 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:20:12,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 18:20:12,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622729423] [2022-03-03 18:20:12,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:20:12,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:20:12,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:20:12,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:20:12,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:20:12,335 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-03 18:20:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:20:12,382 INFO L93 Difference]: Finished difference Result 1122 states and 2131 transitions. [2022-03-03 18:20:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:20:12,384 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-03 18:20:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:20:12,390 INFO L225 Difference]: With dead ends: 1122 [2022-03-03 18:20:12,390 INFO L226 Difference]: Without dead ends: 1122 [2022-03-03 18:20:12,392 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-03 18:20:12,393 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-03 18:20:12,393 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-03 18:20:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-03-03 18:20:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2022-03-03 18:20:12,420 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-03 18:20:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 2131 transitions. [2022-03-03 18:20:12,423 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 2131 transitions. Word has length 40 [2022-03-03 18:20:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:20:12,424 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 2131 transitions. [2022-03-03 18:20:12,425 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-03 18:20:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 2131 transitions. [2022-03-03 18:20:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-03 18:20:12,428 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:20:12,428 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-03 18:20:12,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 18:20:12,429 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-03 18:20:12,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:20:12,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2011316591, now seen corresponding path program 1 times [2022-03-03 18:20:12,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:20:12,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899462895] [2022-03-03 18:20:12,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:20:12,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:20:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:20:12,494 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-03 18:20:12,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:20:12,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899462895] [2022-03-03 18:20:12,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899462895] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:20:12,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:20:12,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 18:20:12,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119395495] [2022-03-03 18:20:12,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:20:12,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:20:12,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:20:12,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:20:12,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:20:12,497 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-03 18:20:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:20:12,515 INFO L93 Difference]: Finished difference Result 1056 states and 2001 transitions. [2022-03-03 18:20:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:20:12,515 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-03 18:20:12,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:20:12,519 INFO L225 Difference]: With dead ends: 1056 [2022-03-03 18:20:12,519 INFO L226 Difference]: Without dead ends: 1056 [2022-03-03 18:20:12,519 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-03 18:20:12,520 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-03 18:20:12,521 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-03 18:20:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-03-03 18:20:12,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1056. [2022-03-03 18:20:12,541 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-03 18:20:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 2001 transitions. [2022-03-03 18:20:12,545 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 2001 transitions. Word has length 51 [2022-03-03 18:20:12,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:20:12,546 INFO L470 AbstractCegarLoop]: Abstraction has 1056 states and 2001 transitions. [2022-03-03 18:20:12,546 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-03 18:20:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 2001 transitions. [2022-03-03 18:20:12,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-03 18:20:12,551 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:20:12,551 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-03 18:20:12,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 18:20:12,551 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-03 18:20:12,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:20:12,552 INFO L85 PathProgramCache]: Analyzing trace with hash -576174563, now seen corresponding path program 1 times [2022-03-03 18:20:12,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:20:12,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568911209] [2022-03-03 18:20:12,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:20:12,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:20:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:20:12,759 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-03 18:20:12,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:20:12,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568911209] [2022-03-03 18:20:12,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568911209] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:20:12,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:20:12,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:20:12,761 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501183598] [2022-03-03 18:20:12,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:20:12,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:20:12,761 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:20:12,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:20:12,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:20:12,762 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-03 18:20:13,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:20:13,071 INFO L93 Difference]: Finished difference Result 1247 states and 2370 transitions. [2022-03-03 18:20:13,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:20:13,072 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-03 18:20:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:20:13,081 INFO L225 Difference]: With dead ends: 1247 [2022-03-03 18:20:13,081 INFO L226 Difference]: Without dead ends: 1247 [2022-03-03 18:20:13,082 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-03 18:20:13,090 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-03 18:20:13,091 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-03 18:20:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2022-03-03 18:20:13,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1160. [2022-03-03 18:20:13,116 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-03 18:20:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 2211 transitions. [2022-03-03 18:20:13,122 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 2211 transitions. Word has length 58 [2022-03-03 18:20:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:20:13,123 INFO L470 AbstractCegarLoop]: Abstraction has 1160 states and 2211 transitions. [2022-03-03 18:20:13,123 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-03 18:20:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 2211 transitions. [2022-03-03 18:20:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-03 18:20:13,125 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:20:13,125 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-03 18:20:13,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 18:20:13,126 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-03 18:20:13,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:20:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash -906441389, now seen corresponding path program 1 times [2022-03-03 18:20:13,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:20:13,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334538052] [2022-03-03 18:20:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:20:13,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:20:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:20:13,249 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-03 18:20:13,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:20:13,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334538052] [2022-03-03 18:20:13,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334538052] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:20:13,251 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:20:13,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:20:13,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300014617] [2022-03-03 18:20:13,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:20:13,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:20:13,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:20:13,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:20:13,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:20:13,252 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-03 18:20:13,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:20:13,467 INFO L93 Difference]: Finished difference Result 1930 states and 3682 transitions. [2022-03-03 18:20:13,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:20:13,467 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-03 18:20:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:20:13,475 INFO L225 Difference]: With dead ends: 1930 [2022-03-03 18:20:13,475 INFO L226 Difference]: Without dead ends: 1930 [2022-03-03 18:20:13,475 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-03 18:20:13,476 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 171 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-03 18:20:13,476 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-03 18:20:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2022-03-03 18:20:13,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1231. [2022-03-03 18:20:13,502 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-03 18:20:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 2349 transitions. [2022-03-03 18:20:13,506 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 2349 transitions. Word has length 59 [2022-03-03 18:20:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:20:13,506 INFO L470 AbstractCegarLoop]: Abstraction has 1231 states and 2349 transitions. [2022-03-03 18:20:13,506 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-03 18:20:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 2349 transitions. [2022-03-03 18:20:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-03 18:20:13,507 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:20:13,507 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-03 18:20:13,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-03 18:20:13,507 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-03 18:20:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:20:13,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2126821387, now seen corresponding path program 1 times [2022-03-03 18:20:13,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:20:13,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273103038] [2022-03-03 18:20:13,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:20:13,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:20:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:20:13,555 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-03 18:20:13,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:20:13,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273103038] [2022-03-03 18:20:13,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273103038] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:20:13,556 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:20:13,556 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 18:20:13,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807125759] [2022-03-03 18:20:13,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:20:13,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:20:13,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:20:13,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:20:13,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:20:13,557 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-03 18:20:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:20:13,569 INFO L93 Difference]: Finished difference Result 1159 states and 2207 transitions. [2022-03-03 18:20:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:20:13,570 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-03 18:20:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:20:13,574 INFO L225 Difference]: With dead ends: 1159 [2022-03-03 18:20:13,574 INFO L226 Difference]: Without dead ends: 1159 [2022-03-03 18:20:13,575 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-03 18:20:13,577 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-03 18:20:13,577 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-03 18:20:13,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-03-03 18:20:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2022-03-03 18:20:13,617 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-03 18:20:13,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 2207 transitions. [2022-03-03 18:20:13,620 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 2207 transitions. Word has length 61 [2022-03-03 18:20:13,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:20:13,621 INFO L470 AbstractCegarLoop]: Abstraction has 1159 states and 2207 transitions. [2022-03-03 18:20:13,621 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-03 18:20:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 2207 transitions. [2022-03-03 18:20:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-03-03 18:20:13,622 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:20:13,622 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-03 18:20:13,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-03 18:20:13,623 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-03 18:20:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:20:13,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1999581971, now seen corresponding path program 1 times [2022-03-03 18:20:13,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:20:13,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076330841] [2022-03-03 18:20:13,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:20:13,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:20:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:20:13,658 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-03 18:20:13,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:20:13,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076330841] [2022-03-03 18:20:13,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076330841] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:20:13,659 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:20:13,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 18:20:13,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188846649] [2022-03-03 18:20:13,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:20:13,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:20:13,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:20:13,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:20:13,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:20:13,660 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-03 18:20:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:20:13,675 INFO L93 Difference]: Finished difference Result 719 states and 1291 transitions. [2022-03-03 18:20:13,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:20:13,675 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-03 18:20:13,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:20:13,678 INFO L225 Difference]: With dead ends: 719 [2022-03-03 18:20:13,678 INFO L226 Difference]: Without dead ends: 719 [2022-03-03 18:20:13,678 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-03 18:20:13,679 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-03 18:20:13,679 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-03 18:20:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-03-03 18:20:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2022-03-03 18:20:13,690 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-03 18:20:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1291 transitions. [2022-03-03 18:20:13,692 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1291 transitions. Word has length 67 [2022-03-03 18:20:13,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:20:13,692 INFO L470 AbstractCegarLoop]: Abstraction has 719 states and 1291 transitions. [2022-03-03 18:20:13,692 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-03 18:20:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1291 transitions. [2022-03-03 18:20:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-03 18:20:13,693 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:20:13,693 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-03 18:20:13,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-03 18:20:13,693 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-03 18:20:13,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:20:13,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2062702493, now seen corresponding path program 1 times [2022-03-03 18:20:13,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:20:13,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721345524] [2022-03-03 18:20:13,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:20:13,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:20:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:20:13,773 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-03 18:20:13,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:20:13,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721345524] [2022-03-03 18:20:13,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721345524] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:20:13,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:20:13,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:20:13,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662978287] [2022-03-03 18:20:13,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:20:13,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:20:13,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:20:13,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:20:13,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:20:13,775 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-03 18:20:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:20:13,896 INFO L93 Difference]: Finished difference Result 838 states and 1502 transitions. [2022-03-03 18:20:13,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:20:13,896 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-03 18:20:13,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:20:13,899 INFO L225 Difference]: With dead ends: 838 [2022-03-03 18:20:13,899 INFO L226 Difference]: Without dead ends: 638 [2022-03-03 18:20:13,899 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-03 18:20:13,900 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-03 18:20:13,900 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-03 18:20:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-03-03 18:20:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 596. [2022-03-03 18:20:13,910 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-03 18:20:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1037 transitions. [2022-03-03 18:20:13,911 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1037 transitions. Word has length 68 [2022-03-03 18:20:13,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:20:13,911 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 1037 transitions. [2022-03-03 18:20:13,912 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-03 18:20:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1037 transitions. [2022-03-03 18:20:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-03 18:20:13,912 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:20:13,912 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-03 18:20:13,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-03 18:20:13,913 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-03 18:20:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:20:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash 283971730, now seen corresponding path program 1 times [2022-03-03 18:20:13,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:20:13,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444607519] [2022-03-03 18:20:13,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:20:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:20:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:20:13,989 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-03 18:20:13,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:20:13,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444607519] [2022-03-03 18:20:13,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444607519] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:20:13,990 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:20:13,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:20:13,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668245483] [2022-03-03 18:20:13,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:20:13,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:20:13,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:20:13,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:20:13,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:20:13,992 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-03 18:20:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:20:14,150 INFO L93 Difference]: Finished difference Result 806 states and 1382 transitions. [2022-03-03 18:20:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:20:14,150 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-03 18:20:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:20:14,153 INFO L225 Difference]: With dead ends: 806 [2022-03-03 18:20:14,153 INFO L226 Difference]: Without dead ends: 635 [2022-03-03 18:20:14,153 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-03 18:20:14,154 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-03 18:20:14,154 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-03 18:20:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-03-03 18:20:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 506. [2022-03-03 18:20:14,164 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-03 18:20:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 878 transitions. [2022-03-03 18:20:14,165 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 878 transitions. Word has length 70 [2022-03-03 18:20:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:20:14,166 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 878 transitions. [2022-03-03 18:20:14,166 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-03 18:20:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 878 transitions. [2022-03-03 18:20:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-03 18:20:14,167 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:20:14,167 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-03 18:20:14,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-03 18:20:14,167 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-03 18:20:14,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:20:14,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1676342582, now seen corresponding path program 1 times [2022-03-03 18:20:14,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:20:14,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074602349] [2022-03-03 18:20:14,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:20:14,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:20:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:20:14,297 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-03 18:20:14,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:20:14,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074602349] [2022-03-03 18:20:14,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074602349] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:20:14,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:20:14,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:20:14,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377306225] [2022-03-03 18:20:14,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:20:14,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:20:14,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:20:14,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:20:14,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:20:14,299 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-03 18:20:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:20:14,693 INFO L93 Difference]: Finished difference Result 588 states and 994 transitions. [2022-03-03 18:20:14,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:20:14,694 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-03 18:20:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:20:14,696 INFO L225 Difference]: With dead ends: 588 [2022-03-03 18:20:14,696 INFO L226 Difference]: Without dead ends: 588 [2022-03-03 18:20:14,697 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-03 18:20:14,697 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.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:20:14,697 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.3s Time] [2022-03-03 18:20:14,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-03-03 18:20:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 448. [2022-03-03 18:20:14,706 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-03 18:20:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 768 transitions. [2022-03-03 18:20:14,713 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 768 transitions. Word has length 78 [2022-03-03 18:20:14,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:20:14,714 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 768 transitions. [2022-03-03 18:20:14,714 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-03 18:20:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 768 transitions. [2022-03-03 18:20:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-03 18:20:14,715 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:20:14,715 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-03 18:20:14,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-03 18:20:14,715 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-03 18:20:14,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:20:14,716 INFO L85 PathProgramCache]: Analyzing trace with hash -248821663, now seen corresponding path program 1 times [2022-03-03 18:20:14,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:20:14,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906793477] [2022-03-03 18:20:14,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:20:14,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:20:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:20:14,904 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-03 18:20:14,905 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:20:14,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906793477] [2022-03-03 18:20:14,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906793477] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:20:14,905 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:20:14,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:20:14,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962370025] [2022-03-03 18:20:14,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:20:14,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:20:14,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:20:14,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:20:14,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:20:14,907 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-03 18:20:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:20:15,214 INFO L93 Difference]: Finished difference Result 436 states and 745 transitions. [2022-03-03 18:20:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:20:15,215 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-03 18:20:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:20:15,217 INFO L225 Difference]: With dead ends: 436 [2022-03-03 18:20:15,217 INFO L226 Difference]: Without dead ends: 404 [2022-03-03 18:20:15,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2022-03-03 18:20:15,218 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 150 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-03 18:20:15,218 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-03 18:20:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-03-03 18:20:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 388. [2022-03-03 18:20:15,225 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-03 18:20:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 661 transitions. [2022-03-03 18:20:15,227 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 661 transitions. Word has length 78 [2022-03-03 18:20:15,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:20:15,229 INFO L470 AbstractCegarLoop]: Abstraction has 388 states and 661 transitions. [2022-03-03 18:20:15,230 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-03 18:20:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 661 transitions. [2022-03-03 18:20:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-03 18:20:15,231 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:20:15,231 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-03 18:20:15,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-03 18:20:15,232 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-03 18:20:15,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:20:15,232 INFO L85 PathProgramCache]: Analyzing trace with hash 772850320, now seen corresponding path program 1 times [2022-03-03 18:20:15,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:20:15,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254883359] [2022-03-03 18:20:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:20:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:20:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-03 18:20:15,272 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-03 18:20:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-03 18:20:15,315 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-03 18:20:15,315 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-03 18:20:15,316 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2022-03-03 18:20:15,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2022-03-03 18:20:15,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2022-03-03 18:20:15,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2022-03-03 18:20:15,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2022-03-03 18:20:15,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2022-03-03 18:20:15,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (8 of 15 remaining) [2022-03-03 18:20:15,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2022-03-03 18:20:15,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2022-03-03 18:20:15,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2022-03-03 18:20:15,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2022-03-03 18:20:15,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2022-03-03 18:20:15,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2022-03-03 18:20:15,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2022-03-03 18:20:15,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2022-03-03 18:20:15,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-03 18:20:15,321 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:20:15,326 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-03 18:20:15,326 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-03 18:20:15,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:20:15 BasicIcfg [2022-03-03 18:20:15,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-03 18:20:15,385 INFO L158 Benchmark]: Toolchain (without parser) took 4967.04ms. Allocated memory was 190.8MB in the beginning and 262.1MB in the end (delta: 71.3MB). Free memory was 134.2MB in the beginning and 168.0MB in the end (delta: -33.8MB). Peak memory consumption was 38.6MB. Max. memory is 8.0GB. [2022-03-03 18:20:15,385 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory is still 153.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 18:20:15,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.70ms. Allocated memory is still 190.8MB. Free memory was 134.1MB in the beginning and 139.4MB in the end (delta: -5.3MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-03-03 18:20:15,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.20ms. Allocated memory is still 190.8MB. Free memory was 139.4MB in the beginning and 136.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-03 18:20:15,386 INFO L158 Benchmark]: Boogie Preprocessor took 27.02ms. Allocated memory is still 190.8MB. Free memory was 136.2MB in the beginning and 134.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 18:20:15,386 INFO L158 Benchmark]: RCFGBuilder took 381.03ms. Allocated memory is still 190.8MB. Free memory was 134.7MB in the beginning and 120.5MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-03-03 18:20:15,386 INFO L158 Benchmark]: TraceAbstraction took 3893.39ms. Allocated memory was 190.8MB in the beginning and 262.1MB in the end (delta: 71.3MB). Free memory was 120.0MB in the beginning and 168.0MB in the end (delta: -48.0MB). Peak memory consumption was 24.4MB. Max. memory is 8.0GB. [2022-03-03 18:20:15,387 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.12ms. Allocated memory is still 190.8MB. Free memory is still 153.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 607.70ms. Allocated memory is still 190.8MB. Free memory was 134.1MB in the beginning and 139.4MB in the end (delta: -5.3MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.20ms. Allocated memory is still 190.8MB. Free memory was 139.4MB in the beginning and 136.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.02ms. Allocated memory is still 190.8MB. Free memory was 136.2MB in the beginning and 134.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 381.03ms. Allocated memory is still 190.8MB. Free memory was 134.7MB in the beginning and 120.5MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3893.39ms. Allocated memory was 190.8MB in the beginning and 262.1MB in the end (delta: 71.3MB). Free memory was 120.0MB in the beginning and 168.0MB in the end (delta: -48.0MB). Peak memory consumption was 24.4MB. 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: x = malloc(sizeof(int)) [1235] * C: *x = 3 [1228] * C: *y = 8 [1229] * C: *x = 3 [1228] 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.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, 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, 1.0s 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1113 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s 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-03 18:20:15,453 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...