/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.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_26-malloc_struct.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:12:15,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:12:15,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:12:16,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:12:16,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:12:16,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:12:16,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:12:16,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:12:16,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:12:16,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:12:16,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:12:16,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:12:16,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:12:16,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:12:16,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:12:16,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:12:16,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:12:16,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:12:16,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:12:16,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:12:16,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:12:16,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:12:16,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:12:16,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:12:16,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:12:16,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:12:16,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:12:16,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:12:16,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:12:16,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:12:16,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:12:16,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:12:16,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:12:16,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:12:16,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:12:16,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:12:16,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:12:16,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:12:16,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:12:16,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:12:16,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:12:16,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:12:16,074 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:12:16,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:12:16,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:12:16,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:12:16,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:12:16,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:12:16,076 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:12:16,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:12:16,076 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:12:16,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:12:16,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:12:16,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:12:16,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:12:16,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:12:16,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:12:16,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:12:16,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:12:16,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:12:16,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:12:16,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:12:16,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:12:16,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:12:16,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:12:16,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:12:16,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:12:16,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:12:16,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:12:16,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:12:16,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:12:16,079 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:12:16,079 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:12:16,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:12:16,080 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-15 20:12:16,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:12:16,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:12:16,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:12:16,322 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 20:12:16,322 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 20:12:16,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/02-base_26-malloc_struct.i [2022-03-15 20:12:16,396 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c1fa6db/cff75780e457459ead75ab3172dca018/FLAGc2c983151 [2022-03-15 20:12:16,812 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 20:12:16,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/02-base_26-malloc_struct.i [2022-03-15 20:12:16,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c1fa6db/cff75780e457459ead75ab3172dca018/FLAGc2c983151 [2022-03-15 20:12:16,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c1fa6db/cff75780e457459ead75ab3172dca018 [2022-03-15 20:12:16,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:12:16,850 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 20:12:16,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 20:12:16,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 20:12:16,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 20:12:16,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:12:16" (1/1) ... [2022-03-15 20:12:16,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3608f3f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:16, skipping insertion in model container [2022-03-15 20:12:16,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:12:16" (1/1) ... [2022-03-15 20:12:16,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 20:12:16,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 20:12:17,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:12:17,381 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 20:12:17,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:12:17,475 INFO L208 MainTranslator]: Completed translation [2022-03-15 20:12:17,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:17 WrapperNode [2022-03-15 20:12:17,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 20:12:17,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:12:17,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:12:17,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:12:17,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:17" (1/1) ... [2022-03-15 20:12:17,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:17" (1/1) ... [2022-03-15 20:12:17,531 INFO L137 Inliner]: procedures = 365, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2022-03-15 20:12:17,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:12:17,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:12:17,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:12:17,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:12:17,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:17" (1/1) ... [2022-03-15 20:12:17,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:17" (1/1) ... [2022-03-15 20:12:17,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:17" (1/1) ... [2022-03-15 20:12:17,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:17" (1/1) ... [2022-03-15 20:12:17,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:17" (1/1) ... [2022-03-15 20:12:17,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:17" (1/1) ... [2022-03-15 20:12:17,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:17" (1/1) ... [2022-03-15 20:12:17,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:12:17,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:12:17,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:12:17,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:12:17,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:17" (1/1) ... [2022-03-15 20:12:17,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:12:17,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:12:17,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 20:12:17,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 20:12:17,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 20:12:17,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 20:12:17,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 20:12:17,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 20:12:17,627 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 20:12:17,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 20:12:17,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 20:12:17,627 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 20:12:17,627 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 20:12:17,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 20:12:17,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:12:17,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:12:17,628 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:12:17,757 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:12:17,758 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:12:18,058 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:12:18,063 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:12:18,063 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:12:18,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:12:18 BoogieIcfgContainer [2022-03-15 20:12:18,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:12:18,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:12:18,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:12:18,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:12:18,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 08:12:16" (1/3) ... [2022-03-15 20:12:18,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38940d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:12:18, skipping insertion in model container [2022-03-15 20:12:18,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:17" (2/3) ... [2022-03-15 20:12:18,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38940d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:12:18, skipping insertion in model container [2022-03-15 20:12:18,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:12:18" (3/3) ... [2022-03-15 20:12:18,086 INFO L111 eAbstractionObserver]: Analyzing ICFG 02-base_26-malloc_struct.i [2022-03-15 20:12:18,089 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:12:18,089 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:12:18,089 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-03-15 20:12:18,090 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:12:18,140 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,140 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,140 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,140 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,141 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,141 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,141 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,141 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,141 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,141 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,141 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,141 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,146 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,146 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,146 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,146 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,146 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,147 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,147 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,147 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,147 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,149 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,149 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,149 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,149 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,149 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,149 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,149 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:18,151 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 20:12:18,204 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:12:18,227 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:12:18,227 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-03-15 20:12:18,235 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:12:18,255 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 107 transitions, 219 flow [2022-03-15 20:12:18,271 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 107 transitions, 219 flow [2022-03-15 20:12:18,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 107 transitions, 219 flow [2022-03-15 20:12:18,343 INFO L129 PetriNetUnfolder]: 0/106 cut-off events. [2022-03-15 20:12:18,344 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 20:12:18,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 106 events. 0/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-03-15 20:12:18,350 INFO L116 LiptonReduction]: Number of co-enabled transitions 1920 [2022-03-15 20:12:20,745 INFO L131 LiptonReduction]: Checked pairs total: 13806 [2022-03-15 20:12:20,746 INFO L133 LiptonReduction]: Total number of compositions: 71 [2022-03-15 20:12:20,750 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 46 transitions, 97 flow [2022-03-15 20:12:20,780 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 462 states, 441 states have (on average 1.9886621315192743) internal successors, (877), 461 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:20,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 462 states, 441 states have (on average 1.9886621315192743) internal successors, (877), 461 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-03-15 20:12:20,787 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:20,787 INFO L514 BasicCegarLoop]: trace histogram [1] [2022-03-15 20:12:20,788 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-15 20:12:20,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:20,791 INFO L85 PathProgramCache]: Analyzing trace with hash 345, now seen corresponding path program 1 times [2022-03-15 20:12:20,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:20,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548007455] [2022-03-15 20:12:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:20,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:20,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:20,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548007455] [2022-03-15 20:12:20,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548007455] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:20,904 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:20,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-03-15 20:12:20,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [933404439] [2022-03-15 20:12:20,907 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:20,908 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:20,912 INFO L252 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2022-03-15 20:12:20,914 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:20,917 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:20,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 20:12:20,922 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:20,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 20:12:20,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:12:20,943 INFO L87 Difference]: Start difference. First operand has 462 states, 441 states have (on average 1.9886621315192743) internal successors, (877), 461 states have internal predecessors, (877), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:20,990 INFO L93 Difference]: Finished difference Result 460 states and 875 transitions. [2022-03-15 20:12:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 20:12:20,992 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-03-15 20:12:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:21,005 INFO L225 Difference]: With dead ends: 460 [2022-03-15 20:12:21,005 INFO L226 Difference]: Without dead ends: 460 [2022-03-15 20:12:21,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:12:21,010 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:21,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:12:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-03-15 20:12:21,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2022-03-15 20:12:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 441 states have (on average 1.9841269841269842) internal successors, (875), 459 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 875 transitions. [2022-03-15 20:12:21,080 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 875 transitions. Word has length 1 [2022-03-15 20:12:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:21,081 INFO L470 AbstractCegarLoop]: Abstraction has 460 states and 875 transitions. [2022-03-15 20:12:21,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 875 transitions. [2022-03-15 20:12:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-03-15 20:12:21,081 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:21,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-03-15 20:12:21,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:12:21,082 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-15 20:12:21,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash 328051992, now seen corresponding path program 1 times [2022-03-15 20:12:21,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:21,089 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193467865] [2022-03-15 20:12:21,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:21,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:21,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:21,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193467865] [2022-03-15 20:12:21,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193467865] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:21,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:21,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:12:21,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [707515979] [2022-03-15 20:12:21,213 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:21,214 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:21,214 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2022-03-15 20:12:21,214 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:21,215 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:21,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:12:21,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:21,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:12:21,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:12:21,218 INFO L87 Difference]: Start difference. First operand 460 states and 875 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:21,251 INFO L93 Difference]: Finished difference Result 399 states and 756 transitions. [2022-03-15 20:12:21,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:12:21,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-03-15 20:12:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:21,253 INFO L225 Difference]: With dead ends: 399 [2022-03-15 20:12:21,253 INFO L226 Difference]: Without dead ends: 399 [2022-03-15 20:12:21,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:12:21,255 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:21,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 24 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:12:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-03-15 20:12:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2022-03-15 20:12:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 391 states have (on average 1.9335038363171355) internal successors, (756), 398 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 756 transitions. [2022-03-15 20:12:21,265 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 756 transitions. Word has length 5 [2022-03-15 20:12:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:21,265 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 756 transitions. [2022-03-15 20:12:21,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 756 transitions. [2022-03-15 20:12:21,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:12:21,266 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:21,266 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:21,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:12:21,267 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-15 20:12:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:21,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1701720943, now seen corresponding path program 1 times [2022-03-15 20:12:21,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:21,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420034338] [2022-03-15 20:12:21,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:21,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:21,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:21,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420034338] [2022-03-15 20:12:21,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420034338] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:21,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:21,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:12:21,366 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1123340769] [2022-03-15 20:12:21,366 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:21,367 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:21,368 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:12:21,368 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:21,368 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:21,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:12:21,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:21,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:12:21,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:21,369 INFO L87 Difference]: Start difference. First operand 399 states and 756 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:21,592 INFO L93 Difference]: Finished difference Result 754 states and 1413 transitions. [2022-03-15 20:12:21,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:12:21,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2022-03-15 20:12:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:21,596 INFO L225 Difference]: With dead ends: 754 [2022-03-15 20:12:21,596 INFO L226 Difference]: Without dead ends: 754 [2022-03-15 20:12:21,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:21,597 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 64 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:21,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 77 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:12:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-03-15 20:12:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 467. [2022-03-15 20:12:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 459 states have (on average 1.9477124183006536) internal successors, (894), 466 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 894 transitions. [2022-03-15 20:12:21,607 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 894 transitions. Word has length 11 [2022-03-15 20:12:21,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:21,607 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 894 transitions. [2022-03-15 20:12:21,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 894 transitions. [2022-03-15 20:12:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:12:21,608 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:21,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:21,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:12:21,608 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-15 20:12:21,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:21,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1149552404, now seen corresponding path program 1 times [2022-03-15 20:12:21,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:21,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132416318] [2022-03-15 20:12:21,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:21,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:21,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:21,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132416318] [2022-03-15 20:12:21,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132416318] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:21,668 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:21,668 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:12:21,668 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1376950090] [2022-03-15 20:12:21,668 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:21,669 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:21,670 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:12:21,670 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:21,670 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:21,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:12:21,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:21,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:12:21,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:21,671 INFO L87 Difference]: Start difference. First operand 467 states and 894 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:21,831 INFO L93 Difference]: Finished difference Result 541 states and 1029 transitions. [2022-03-15 20:12:21,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:12:21,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2022-03-15 20:12:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:21,834 INFO L225 Difference]: With dead ends: 541 [2022-03-15 20:12:21,834 INFO L226 Difference]: Without dead ends: 541 [2022-03-15 20:12:21,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:21,835 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 39 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:21,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 53 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:12:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-03-15 20:12:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 509. [2022-03-15 20:12:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 501 states have (on average 1.9441117764471059) internal successors, (974), 508 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 974 transitions. [2022-03-15 20:12:21,871 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 974 transitions. Word has length 11 [2022-03-15 20:12:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:21,871 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 974 transitions. [2022-03-15 20:12:21,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 974 transitions. [2022-03-15 20:12:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:12:21,872 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:21,872 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:21,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 20:12:21,873 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-15 20:12:21,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1903751215, now seen corresponding path program 1 times [2022-03-15 20:12:21,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:21,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205101336] [2022-03-15 20:12:21,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:21,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:21,898 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:21,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205101336] [2022-03-15 20:12:21,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205101336] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:21,899 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:21,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:12:21,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1435158039] [2022-03-15 20:12:21,899 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:21,900 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:21,903 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 62 transitions. [2022-03-15 20:12:21,904 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:21,980 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6882#(not (= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 0))] [2022-03-15 20:12:21,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:12:21,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:21,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:12:21,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:12:21,981 INFO L87 Difference]: Start difference. First operand 509 states and 974 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:21,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:21,998 INFO L93 Difference]: Finished difference Result 228 states and 384 transitions. [2022-03-15 20:12:21,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:12:21,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 16 [2022-03-15 20:12:21,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:22,000 INFO L225 Difference]: With dead ends: 228 [2022-03-15 20:12:22,000 INFO L226 Difference]: Without dead ends: 228 [2022-03-15 20:12:22,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:12:22,000 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 33 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:22,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 40 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:12:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-03-15 20:12:22,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-03-15 20:12:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 222 states have (on average 1.7297297297297298) internal successors, (384), 227 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 384 transitions. [2022-03-15 20:12:22,005 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 384 transitions. Word has length 16 [2022-03-15 20:12:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:22,005 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 384 transitions. [2022-03-15 20:12:22,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 384 transitions. [2022-03-15 20:12:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:12:22,005 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:22,005 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:22,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 20:12:22,006 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-15 20:12:22,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash -605002521, now seen corresponding path program 1 times [2022-03-15 20:12:22,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:22,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878015649] [2022-03-15 20:12:22,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:22,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:22,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:22,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878015649] [2022-03-15 20:12:22,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878015649] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:22,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:22,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:12:22,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924680823] [2022-03-15 20:12:22,084 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:22,085 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:22,087 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2022-03-15 20:12:22,087 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:22,087 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:22,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:12:22,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:22,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:12:22,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:22,088 INFO L87 Difference]: Start difference. First operand 228 states and 384 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:22,255 INFO L93 Difference]: Finished difference Result 303 states and 510 transitions. [2022-03-15 20:12:22,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:12:22,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2022-03-15 20:12:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:22,256 INFO L225 Difference]: With dead ends: 303 [2022-03-15 20:12:22,257 INFO L226 Difference]: Without dead ends: 280 [2022-03-15 20:12:22,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:22,257 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 49 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:22,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 97 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:12:22,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-03-15 20:12:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 263. [2022-03-15 20:12:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 257 states have (on average 1.7898832684824904) internal successors, (460), 262 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 460 transitions. [2022-03-15 20:12:22,262 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 460 transitions. Word has length 18 [2022-03-15 20:12:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:22,262 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 460 transitions. [2022-03-15 20:12:22,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 460 transitions. [2022-03-15 20:12:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:12:22,263 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:22,263 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:22,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:12:22,263 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-15 20:12:22,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1207208839, now seen corresponding path program 1 times [2022-03-15 20:12:22,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:22,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223916048] [2022-03-15 20:12:22,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:22,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:22,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:22,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223916048] [2022-03-15 20:12:22,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223916048] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:22,332 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:22,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:12:22,333 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1111375470] [2022-03-15 20:12:22,333 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:22,335 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:22,337 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2022-03-15 20:12:22,338 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:22,339 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:22,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:12:22,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:22,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:12:22,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:22,343 INFO L87 Difference]: Start difference. First operand 263 states and 460 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:22,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:22,434 INFO L93 Difference]: Finished difference Result 283 states and 496 transitions. [2022-03-15 20:12:22,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:12:22,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2022-03-15 20:12:22,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:22,436 INFO L225 Difference]: With dead ends: 283 [2022-03-15 20:12:22,436 INFO L226 Difference]: Without dead ends: 250 [2022-03-15 20:12:22,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:22,436 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:22,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:12:22,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-03-15 20:12:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-03-15 20:12:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.8040816326530613) internal successors, (442), 249 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 442 transitions. [2022-03-15 20:12:22,441 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 442 transitions. Word has length 19 [2022-03-15 20:12:22,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:22,441 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 442 transitions. [2022-03-15 20:12:22,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 442 transitions. [2022-03-15 20:12:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:12:22,442 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:22,442 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] [2022-03-15 20:12:22,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 20:12:22,442 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-15 20:12:22,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:22,442 INFO L85 PathProgramCache]: Analyzing trace with hash 272650861, now seen corresponding path program 1 times [2022-03-15 20:12:22,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:22,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566666304] [2022-03-15 20:12:22,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:22,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:22,750 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:22,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566666304] [2022-03-15 20:12:22,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566666304] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:22,750 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:22,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 20:12:22,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [192211594] [2022-03-15 20:12:22,750 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:22,752 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:22,758 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 61 transitions. [2022-03-15 20:12:22,758 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:23,361 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:23,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:12:23,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:23,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:12:23,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:23,362 INFO L87 Difference]: Start difference. First operand 250 states and 442 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:23,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:23,647 INFO L93 Difference]: Finished difference Result 256 states and 444 transitions. [2022-03-15 20:12:23,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:12:23,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 23 [2022-03-15 20:12:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:23,649 INFO L225 Difference]: With dead ends: 256 [2022-03-15 20:12:23,649 INFO L226 Difference]: Without dead ends: 256 [2022-03-15 20:12:23,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:23,649 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 51 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:23,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 68 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:12:23,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-03-15 20:12:23,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 245. [2022-03-15 20:12:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 240 states have (on average 1.8) internal successors, (432), 244 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 432 transitions. [2022-03-15 20:12:23,654 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 432 transitions. Word has length 23 [2022-03-15 20:12:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:23,654 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 432 transitions. [2022-03-15 20:12:23,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 432 transitions. [2022-03-15 20:12:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:12:23,655 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:23,655 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] [2022-03-15 20:12:23,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 20:12:23,655 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-15 20:12:23,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:23,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1486853651, now seen corresponding path program 1 times [2022-03-15 20:12:23,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:23,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568363428] [2022-03-15 20:12:23,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:23,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:23,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:23,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568363428] [2022-03-15 20:12:23,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568363428] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:23,758 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:23,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 20:12:23,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1885211499] [2022-03-15 20:12:23,759 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:23,762 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:23,766 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 29 transitions. [2022-03-15 20:12:23,766 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:23,789 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:23,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:12:23,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:23,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:12:23,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:23,790 INFO L87 Difference]: Start difference. First operand 245 states and 432 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:24,051 INFO L93 Difference]: Finished difference Result 247 states and 436 transitions. [2022-03-15 20:12:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:12:24,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 23 [2022-03-15 20:12:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:24,053 INFO L225 Difference]: With dead ends: 247 [2022-03-15 20:12:24,053 INFO L226 Difference]: Without dead ends: 247 [2022-03-15 20:12:24,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:12:24,053 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:24,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 30 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:12:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-03-15 20:12:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2022-03-15 20:12:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 238 states have (on average 1.7983193277310925) internal successors, (428), 242 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 428 transitions. [2022-03-15 20:12:24,058 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 428 transitions. Word has length 23 [2022-03-15 20:12:24,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:24,058 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 428 transitions. [2022-03-15 20:12:24,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 428 transitions. [2022-03-15 20:12:24,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:12:24,059 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:24,059 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] [2022-03-15 20:12:24,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 20:12:24,060 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-15 20:12:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:24,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1582003811, now seen corresponding path program 2 times [2022-03-15 20:12:24,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:24,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250712611] [2022-03-15 20:12:24,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:24,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:24,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:24,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250712611] [2022-03-15 20:12:24,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250712611] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:24,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:24,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 20:12:24,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [918391372] [2022-03-15 20:12:24,247 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:24,250 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:24,254 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 29 transitions. [2022-03-15 20:12:24,254 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:24,283 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:24,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:12:24,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:24,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:12:24,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:24,284 INFO L87 Difference]: Start difference. First operand 243 states and 428 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:24,454 INFO L93 Difference]: Finished difference Result 233 states and 409 transitions. [2022-03-15 20:12:24,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:12:24,454 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 23 [2022-03-15 20:12:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:24,455 INFO L225 Difference]: With dead ends: 233 [2022-03-15 20:12:24,455 INFO L226 Difference]: Without dead ends: 229 [2022-03-15 20:12:24,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:24,456 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:24,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 30 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:12:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-03-15 20:12:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2022-03-15 20:12:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 209 states have (on average 1.7655502392344498) internal successors, (369), 211 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 369 transitions. [2022-03-15 20:12:24,460 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 369 transitions. Word has length 23 [2022-03-15 20:12:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:24,460 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 369 transitions. [2022-03-15 20:12:24,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 369 transitions. [2022-03-15 20:12:24,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 20:12:24,461 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:24,461 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:24,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 20:12:24,461 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-15 20:12:24,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:24,462 INFO L85 PathProgramCache]: Analyzing trace with hash -137756148, now seen corresponding path program 1 times [2022-03-15 20:12:24,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:24,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820575560] [2022-03-15 20:12:24,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:24,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:24,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:24,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820575560] [2022-03-15 20:12:24,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820575560] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:24,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:24,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 20:12:24,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [758030045] [2022-03-15 20:12:24,702 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:24,705 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:24,710 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 62 transitions. [2022-03-15 20:12:24,711 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:25,604 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:25,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:12:25,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:25,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:12:25,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:25,605 INFO L87 Difference]: Start difference. First operand 212 states and 369 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:25,832 INFO L93 Difference]: Finished difference Result 215 states and 370 transitions. [2022-03-15 20:12:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:12:25,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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 24 [2022-03-15 20:12:25,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:25,833 INFO L225 Difference]: With dead ends: 215 [2022-03-15 20:12:25,833 INFO L226 Difference]: Without dead ends: 215 [2022-03-15 20:12:25,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:25,834 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:25,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 72 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:12:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-03-15 20:12:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 207. [2022-03-15 20:12:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 204 states have (on average 1.7647058823529411) internal successors, (360), 206 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 360 transitions. [2022-03-15 20:12:25,838 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 360 transitions. Word has length 24 [2022-03-15 20:12:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:25,838 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 360 transitions. [2022-03-15 20:12:25,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 360 transitions. [2022-03-15 20:12:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 20:12:25,839 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:25,839 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] [2022-03-15 20:12:25,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 20:12:25,839 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-15 20:12:25,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:25,839 INFO L85 PathProgramCache]: Analyzing trace with hash 24528492, now seen corresponding path program 1 times [2022-03-15 20:12:25,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:25,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513344393] [2022-03-15 20:12:25,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:25,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:26,156 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:26,156 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513344393] [2022-03-15 20:12:26,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513344393] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:26,156 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:26,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 20:12:26,156 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [578856445] [2022-03-15 20:12:26,157 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:26,160 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:26,166 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 63 transitions. [2022-03-15 20:12:26,166 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:26,995 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:26,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:12:26,996 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:26,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:12:26,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:26,996 INFO L87 Difference]: Start difference. First operand 207 states and 360 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:27,229 INFO L93 Difference]: Finished difference Result 210 states and 361 transitions. [2022-03-15 20:12:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:12:27,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 25 [2022-03-15 20:12:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:27,231 INFO L225 Difference]: With dead ends: 210 [2022-03-15 20:12:27,231 INFO L226 Difference]: Without dead ends: 210 [2022-03-15 20:12:27,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:27,231 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:27,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 68 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:12:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-03-15 20:12:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 202. [2022-03-15 20:12:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 199 states have (on average 1.763819095477387) internal successors, (351), 201 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 351 transitions. [2022-03-15 20:12:27,235 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 351 transitions. Word has length 25 [2022-03-15 20:12:27,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:27,235 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 351 transitions. [2022-03-15 20:12:27,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:27,235 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 351 transitions. [2022-03-15 20:12:27,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:12:27,236 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:27,236 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] [2022-03-15 20:12:27,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 20:12:27,236 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-15 20:12:27,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash 760385067, now seen corresponding path program 1 times [2022-03-15 20:12:27,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:27,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146194258] [2022-03-15 20:12:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:27,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:27,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:27,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146194258] [2022-03-15 20:12:27,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146194258] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:27,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:27,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 20:12:27,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1155170701] [2022-03-15 20:12:27,609 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:27,611 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:27,618 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 64 transitions. [2022-03-15 20:12:27,618 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:28,428 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:28,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:12:28,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:28,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:12:28,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:28,429 INFO L87 Difference]: Start difference. First operand 202 states and 351 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:28,657 INFO L93 Difference]: Finished difference Result 201 states and 344 transitions. [2022-03-15 20:12:28,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:12:28,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 26 [2022-03-15 20:12:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:28,658 INFO L225 Difference]: With dead ends: 201 [2022-03-15 20:12:28,659 INFO L226 Difference]: Without dead ends: 201 [2022-03-15 20:12:28,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:28,659 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:28,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 68 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:12:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-03-15 20:12:28,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 177. [2022-03-15 20:12:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 174 states have (on average 1.7586206896551724) internal successors, (306), 176 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 306 transitions. [2022-03-15 20:12:28,663 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 306 transitions. Word has length 26 [2022-03-15 20:12:28,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:28,664 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 306 transitions. [2022-03-15 20:12:28,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 306 transitions. [2022-03-15 20:12:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 20:12:28,664 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:28,664 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] [2022-03-15 20:12:28,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 20:12:28,665 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-15 20:12:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2116973056, now seen corresponding path program 1 times [2022-03-15 20:12:28,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:28,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988774231] [2022-03-15 20:12:28,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:28,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:12:28,681 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:12:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:12:28,708 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:12:28,708 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:12:28,709 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2022-03-15 20:12:28,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2022-03-15 20:12:28,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2022-03-15 20:12:28,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2022-03-15 20:12:28,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2022-03-15 20:12:28,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (8 of 14 remaining) [2022-03-15 20:12:28,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2022-03-15 20:12:28,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2022-03-15 20:12:28,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2022-03-15 20:12:28,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2022-03-15 20:12:28,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2022-03-15 20:12:28,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2022-03-15 20:12:28,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2022-03-15 20:12:28,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2022-03-15 20:12:28,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 20:12:28,712 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:28,716 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:12:28,716 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:12:28,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:12:28 BasicIcfg [2022-03-15 20:12:28,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:12:28,741 INFO L158 Benchmark]: Toolchain (without parser) took 11890.77ms. Allocated memory was 172.0MB in the beginning and 355.5MB in the end (delta: 183.5MB). Free memory was 120.8MB in the beginning and 252.2MB in the end (delta: -131.4MB). Peak memory consumption was 53.1MB. Max. memory is 8.0GB. [2022-03-15 20:12:28,741 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:12:28,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.17ms. Allocated memory is still 172.0MB. Free memory was 120.6MB in the beginning and 121.9MB in the end (delta: -1.3MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-03-15 20:12:28,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.37ms. Allocated memory is still 172.0MB. Free memory was 121.9MB in the beginning and 119.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:12:28,741 INFO L158 Benchmark]: Boogie Preprocessor took 29.45ms. Allocated memory is still 172.0MB. Free memory was 119.3MB in the beginning and 117.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:12:28,741 INFO L158 Benchmark]: RCFGBuilder took 501.68ms. Allocated memory is still 172.0MB. Free memory was 117.2MB in the beginning and 103.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-03-15 20:12:28,741 INFO L158 Benchmark]: TraceAbstraction took 10675.17ms. Allocated memory was 172.0MB in the beginning and 355.5MB in the end (delta: 183.5MB). Free memory was 102.5MB in the beginning and 252.2MB in the end (delta: -149.7MB). Peak memory consumption was 34.8MB. Max. memory is 8.0GB. [2022-03-15 20:12:28,742 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 625.17ms. Allocated memory is still 172.0MB. Free memory was 120.6MB in the beginning and 121.9MB in the end (delta: -1.3MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.37ms. Allocated memory is still 172.0MB. Free memory was 121.9MB in the beginning and 119.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.45ms. Allocated memory is still 172.0MB. Free memory was 119.3MB in the beginning and 117.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 501.68ms. Allocated memory is still 172.0MB. Free memory was 117.2MB in the beginning and 103.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 10675.17ms. Allocated memory was 172.0MB in the beginning and 355.5MB in the end (delta: 183.5MB). Free memory was 102.5MB in the beginning and 252.2MB in the end (delta: -149.7MB). Peak memory consumption was 34.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 111 PlacesBefore, 50 PlacesAfterwards, 107 TransitionsBefore, 46 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 71 TotalNumberOfCompositions, 13806 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2955, positive: 2354, positive conditional: 0, positive unconditional: 2354, negative: 601, negative conditional: 0, negative unconditional: 601, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 774, positive: 715, positive conditional: 0, positive unconditional: 715, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2955, positive: 1639, positive conditional: 0, positive unconditional: 1639, negative: 542, negative conditional: 0, negative unconditional: 542, unknown: 774, unknown conditional: 0, unknown unconditional: 774] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44 - 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: 1245]: Data race detected Data race detected The following path leads to a data race: [L1227] 0 data *d; [L1228] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1237] 0 pthread_t id; [L1238] 0 data *z; [L1239] 0 d = malloc(sizeof(data)) [L1240] 0 z = d [L1241] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, d={-2:0}, id={9:0}, m={3:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1, z={-2:0}] [L1243] EXPR 0 d->x VAL [arg={0:0}, d={-2:0}, d->x=103, id={9:0}, m={3:0}, z={-2:0}] [L1243] 0 printf("%d\n",d->x) [L1245] EXPR 0 z->y VAL [arg={0:0}, d={-2:0}, id={9:0}, m={3:0}, z={-2:0}, z->y=101] [L1231] EXPR 1 d->x VAL [arg={0:0}, arg={0:0}, d={-2:0}, m={3:0}] [L1231] 1 d->x = 3 VAL [arg={0:0}, arg={0:0}, d={-2:0}, m={3:0}] [L1231] 1 d->x = 3 VAL [arg={0:0}, arg={0:0}, d={-2:0}, m={3:0}] [L1232] EXPR 1 d->y VAL [arg={0:0}, arg={0:0}, d={-2:0}, m={3:0}] [L1232] 1 d->y = 8 VAL [arg={0:0}, arg={0:0}, d={-2:0}, d->y = 8=104, m={3:0}] [L1245] 0 printf("%d\n",z->y) VAL [arg={0:0}, arg={0:0}, d={-2:0}, d->y = 8=104, id={9:0}, m={3:0}, z={-2:0}, z->y=101] 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: d->y = 8 [1232] * C: d->x = 3 [1231] * C: d->x = 3 [1231] * C: d->x = 3 [1231] * C: d->x = 3 [1231] * C: d = malloc(sizeof(data)) [1239] and C: printf("%d\n",z->y) [1245] - 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: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1243]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1243]: 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 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: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1232]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1232]: 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, 140 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 480 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 480 mSDsluCounter, 692 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 625 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2792 IncrementalHoareTripleChecker+Invalid, 2982 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 308 mSDtfsCounter, 2792 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 102 SyntacticMatches, 16 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=509occurred in iteration=4, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 408 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 5414 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-03-15 20:12:28,798 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...