/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-BasicCegarLoop.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/04-mutex_37-indirect_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-16 13:20:42,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-16 13:20:42,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-16 13:20:42,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-16 13:20:42,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-16 13:20:42,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-16 13:20:42,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-16 13:20:42,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-16 13:20:42,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-16 13:20:42,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-16 13:20:42,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-16 13:20:42,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-16 13:20:42,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-16 13:20:42,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-16 13:20:42,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-16 13:20:42,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-16 13:20:42,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-16 13:20:42,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-16 13:20:42,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-16 13:20:42,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-16 13:20:42,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-16 13:20:42,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-16 13:20:42,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-16 13:20:42,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-16 13:20:42,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-16 13:20:42,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-16 13:20:42,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-16 13:20:42,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-16 13:20:42,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-16 13:20:42,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-16 13:20:42,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-16 13:20:42,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-16 13:20:42,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-16 13:20:42,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-16 13:20:42,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-16 13:20:42,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-16 13:20:42,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-16 13:20:42,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-16 13:20:42,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-16 13:20:42,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-16 13:20:42,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-16 13:20:42,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-BasicCegarLoop.epf [2022-02-16 13:20:42,784 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-16 13:20:42,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-16 13:20:42,785 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-16 13:20:42,785 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-16 13:20:42,786 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-16 13:20:42,786 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-16 13:20:42,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-16 13:20:42,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-16 13:20:42,787 INFO L138 SettingsManager]: * Use SBE=true [2022-02-16 13:20:42,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-16 13:20:42,788 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-16 13:20:42,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-16 13:20:42,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-16 13:20:42,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-16 13:20:42,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-16 13:20:42,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-16 13:20:42,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-16 13:20:42,789 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-16 13:20:42,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-16 13:20:42,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-16 13:20:42,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-16 13:20:42,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-16 13:20:42,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-16 13:20:42,790 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-16 13:20:42,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-16 13:20:42,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-16 13:20:42,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-16 13:20:42,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-16 13:20:42,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-16 13:20:42,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-16 13:20:42,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-16 13:20:42,792 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-16 13:20:42,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-16 13:20:42,792 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-02-16 13:20:42,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-02-16 13:20:43,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-16 13:20:43,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-16 13:20:43,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-16 13:20:43,048 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-16 13:20:43,048 INFO L275 PluginConnector]: CDTParser initialized [2022-02-16 13:20:43,049 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_37-indirect_rc.i [2022-02-16 13:20:43,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af06c3b1a/f64ccabebcee4dd19bbb844e4267958f/FLAGca3f52ae9 [2022-02-16 13:20:43,578 INFO L306 CDTParser]: Found 1 translation units. [2022-02-16 13:20:43,578 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_37-indirect_rc.i [2022-02-16 13:20:43,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af06c3b1a/f64ccabebcee4dd19bbb844e4267958f/FLAGca3f52ae9 [2022-02-16 13:20:43,914 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af06c3b1a/f64ccabebcee4dd19bbb844e4267958f [2022-02-16 13:20:43,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-16 13:20:43,916 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-16 13:20:43,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-16 13:20:43,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-16 13:20:43,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-16 13:20:43,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:20:43" (1/1) ... [2022-02-16 13:20:43,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a447226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:20:43, skipping insertion in model container [2022-02-16 13:20:43,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:20:43" (1/1) ... [2022-02-16 13:20:43,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-16 13:20:43,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-16 13:20:44,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-16 13:20:44,267 INFO L203 MainTranslator]: Completed pre-run [2022-02-16 13:20:44,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-16 13:20:44,367 INFO L208 MainTranslator]: Completed translation [2022-02-16 13:20:44,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:20:44 WrapperNode [2022-02-16 13:20:44,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-16 13:20:44,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-16 13:20:44,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-16 13:20:44,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-16 13:20:44,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:20:44" (1/1) ... [2022-02-16 13:20:44,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:20:44" (1/1) ... [2022-02-16 13:20:44,431 INFO L137 Inliner]: procedures = 162, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2022-02-16 13:20:44,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-16 13:20:44,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-16 13:20:44,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-16 13:20:44,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-16 13:20:44,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:20:44" (1/1) ... [2022-02-16 13:20:44,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:20:44" (1/1) ... [2022-02-16 13:20:44,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:20:44" (1/1) ... [2022-02-16 13:20:44,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:20:44" (1/1) ... [2022-02-16 13:20:44,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:20:44" (1/1) ... [2022-02-16 13:20:44,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:20:44" (1/1) ... [2022-02-16 13:20:44,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:20:44" (1/1) ... [2022-02-16 13:20:44,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-16 13:20:44,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-16 13:20:44,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-16 13:20:44,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-16 13:20:44,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:20:44" (1/1) ... [2022-02-16 13:20:44,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-16 13:20:44,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 13:20:44,557 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-02-16 13:20:44,561 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-02-16 13:20:44,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-16 13:20:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-16 13:20:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-16 13:20:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-16 13:20:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-16 13:20:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-16 13:20:44,589 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-16 13:20:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-16 13:20:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-16 13:20:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-16 13:20:44,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-16 13:20:44,593 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-16 13:20:44,714 INFO L234 CfgBuilder]: Building ICFG [2022-02-16 13:20:44,716 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-16 13:20:45,034 INFO L275 CfgBuilder]: Performing block encoding [2022-02-16 13:20:45,043 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-16 13:20:45,043 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-16 13:20:45,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:20:45 BoogieIcfgContainer [2022-02-16 13:20:45,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-16 13:20:45,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-16 13:20:45,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-16 13:20:45,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-16 13:20:45,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 01:20:43" (1/3) ... [2022-02-16 13:20:45,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382dcead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:20:45, skipping insertion in model container [2022-02-16 13:20:45,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:20:44" (2/3) ... [2022-02-16 13:20:45,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382dcead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:20:45, skipping insertion in model container [2022-02-16 13:20:45,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:20:45" (3/3) ... [2022-02-16 13:20:45,056 INFO L111 eAbstractionObserver]: Analyzing ICFG 04-mutex_37-indirect_rc.i [2022-02-16 13:20:45,061 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-16 13:20:45,061 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-16 13:20:45,062 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-02-16 13:20:45,062 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-16 13:20:45,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,124 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,124 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,125 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,125 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,135 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,136 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 13:20:45,139 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-16 13:20:45,189 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-16 13:20:45,197 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-16 13:20:45,198 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-02-16 13:20:45,213 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 109 transitions, 226 flow [2022-02-16 13:20:45,295 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 962 states, 940 states have (on average 1.9382978723404256) internal successors, (1822), 961 states have internal predecessors, (1822), 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-02-16 13:20:52,556 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 211944 transitions and produced 114765 states. [2022-02-16 13:20:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 114765 states, 100984 states have (on average 1.443832686366157) internal successors, (145804), 114764 states have internal predecessors, (145804), 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-02-16 13:20:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-16 13:20:53,926 INFO L506 BasicCegarLoop]: Found error trace [2022-02-16 13:20:53,928 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-02-16 13:20:53,929 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-02-16 13:20:53,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 13:20:53,939 INFO L85 PathProgramCache]: Analyzing trace with hash -757145905, now seen corresponding path program 1 times [2022-02-16 13:20:53,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 13:20:53,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927762230] [2022-02-16 13:20:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 13:20:53,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 13:20:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 13:20:54,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-02-16 13:20:54,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 13:20:54,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927762230] [2022-02-16 13:20:54,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927762230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 13:20:54,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 13:20:54,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-16 13:20:54,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577648377] [2022-02-16 13:20:54,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 13:20:54,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-16 13:20:54,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 13:20:54,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-16 13:20:54,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-16 13:20:55,868 INFO L87 Difference]: Start difference. First operand has 114765 states, 100984 states have (on average 1.443832686366157) internal successors, (145804), 114764 states have internal predecessors, (145804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-02-16 13:20:59,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-16 13:20:59,192 INFO L93 Difference]: Finished difference Result 114764 states and 145803 transitions. [2022-02-16 13:20:59,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 13:20:59,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-02-16 13:20:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-16 13:20:59,816 INFO L225 Difference]: With dead ends: 114764 [2022-02-16 13:20:59,817 INFO L226 Difference]: Without dead ends: 65474 [2022-02-16 13:20:59,818 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-02-16 13:20:59,822 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-16 13:20:59,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 184 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-16 13:20:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65474 states. [2022-02-16 13:21:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65474 to 911. [2022-02-16 13:21:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 839 states have (on average 1.4862932061978547) internal successors, (1247), 910 states have internal predecessors, (1247), 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-02-16 13:21:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1247 transitions. [2022-02-16 13:21:00,536 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1247 transitions. Word has length 26 [2022-02-16 13:21:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-16 13:21:00,537 INFO L470 AbstractCegarLoop]: Abstraction has 911 states and 1247 transitions. [2022-02-16 13:21:00,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-02-16 13:21:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1247 transitions. [2022-02-16 13:21:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-16 13:21:00,647 INFO L506 BasicCegarLoop]: Found error trace [2022-02-16 13:21:00,647 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] [2022-02-16 13:21:00,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-16 13:21:00,648 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-02-16 13:21:00,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 13:21:00,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1767735309, now seen corresponding path program 1 times [2022-02-16 13:21:00,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 13:21:00,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860217652] [2022-02-16 13:21:00,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 13:21:00,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 13:21:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 13:21:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 13:21:00,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 13:21:00,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860217652] [2022-02-16 13:21:00,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860217652] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 13:21:00,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 13:21:00,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-16 13:21:00,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132486398] [2022-02-16 13:21:00,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 13:21:00,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-16 13:21:00,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 13:21:00,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-16 13:21:00,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-16 13:21:00,741 INFO L87 Difference]: Start difference. First operand 911 states and 1247 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-02-16 13:21:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-16 13:21:00,769 INFO L93 Difference]: Finished difference Result 881 states and 1217 transitions. [2022-02-16 13:21:00,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 13:21:00,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-02-16 13:21:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-16 13:21:00,783 INFO L225 Difference]: With dead ends: 881 [2022-02-16 13:21:00,783 INFO L226 Difference]: Without dead ends: 881 [2022-02-16 13:21:00,784 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-02-16 13:21:00,785 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 69 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-16 13:21:00,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-16 13:21:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-02-16 13:21:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2022-02-16 13:21:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 814 states have (on average 1.4950859950859952) internal successors, (1217), 880 states have internal predecessors, (1217), 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-02-16 13:21:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1217 transitions. [2022-02-16 13:21:00,803 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1217 transitions. Word has length 28 [2022-02-16 13:21:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-16 13:21:00,804 INFO L470 AbstractCegarLoop]: Abstraction has 881 states and 1217 transitions. [2022-02-16 13:21:00,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-02-16 13:21:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1217 transitions. [2022-02-16 13:21:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-16 13:21:00,805 INFO L506 BasicCegarLoop]: Found error trace [2022-02-16 13:21:00,806 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-16 13:21:00,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-16 13:21:00,806 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-02-16 13:21:00,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 13:21:00,807 INFO L85 PathProgramCache]: Analyzing trace with hash -2128740494, now seen corresponding path program 1 times [2022-02-16 13:21:00,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 13:21:00,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889696054] [2022-02-16 13:21:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 13:21:00,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 13:21:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 13:21:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 13:21:00,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 13:21:00,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889696054] [2022-02-16 13:21:00,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889696054] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 13:21:00,870 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 13:21:00,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-16 13:21:00,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726659296] [2022-02-16 13:21:00,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 13:21:00,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-16 13:21:00,871 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 13:21:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-16 13:21:00,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-16 13:21:00,872 INFO L87 Difference]: Start difference. First operand 881 states and 1217 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-02-16 13:21:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-16 13:21:00,892 INFO L93 Difference]: Finished difference Result 880 states and 1216 transitions. [2022-02-16 13:21:00,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 13:21:00,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2022-02-16 13:21:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-16 13:21:00,901 INFO L225 Difference]: With dead ends: 880 [2022-02-16 13:21:00,901 INFO L226 Difference]: Without dead ends: 880 [2022-02-16 13:21:00,901 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-02-16 13:21:00,902 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-16 13:21:00,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 180 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-16 13:21:00,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-02-16 13:21:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2022-02-16 13:21:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 814 states have (on average 1.4938574938574938) internal successors, (1216), 879 states have internal predecessors, (1216), 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-02-16 13:21:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1216 transitions. [2022-02-16 13:21:00,917 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1216 transitions. Word has length 32 [2022-02-16 13:21:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-16 13:21:00,918 INFO L470 AbstractCegarLoop]: Abstraction has 880 states and 1216 transitions. [2022-02-16 13:21:00,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-02-16 13:21:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1216 transitions. [2022-02-16 13:21:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-16 13:21:00,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-16 13:21:00,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-16 13:21:00,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-16 13:21:00,921 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-02-16 13:21:00,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 13:21:00,921 INFO L85 PathProgramCache]: Analyzing trace with hash -159277023, now seen corresponding path program 1 times [2022-02-16 13:21:00,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 13:21:00,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297449994] [2022-02-16 13:21:00,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 13:21:00,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 13:21:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 13:21:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 13:21:01,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 13:21:01,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297449994] [2022-02-16 13:21:01,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297449994] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 13:21:01,000 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 13:21:01,000 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-16 13:21:01,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922278979] [2022-02-16 13:21:01,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 13:21:01,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-16 13:21:01,001 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 13:21:01,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-16 13:21:01,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-16 13:21:01,002 INFO L87 Difference]: Start difference. First operand 880 states and 1216 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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-02-16 13:21:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-16 13:21:01,022 INFO L93 Difference]: Finished difference Result 849 states and 1185 transitions. [2022-02-16 13:21:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 13:21:01,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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 43 [2022-02-16 13:21:01,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-16 13:21:01,027 INFO L225 Difference]: With dead ends: 849 [2022-02-16 13:21:01,030 INFO L226 Difference]: Without dead ends: 849 [2022-02-16 13:21:01,030 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-02-16 13:21:01,032 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-16 13:21:01,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 187 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-16 13:21:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-02-16 13:21:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2022-02-16 13:21:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 814 states have (on average 1.4557739557739557) internal successors, (1185), 848 states have internal predecessors, (1185), 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-02-16 13:21:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1185 transitions. [2022-02-16 13:21:01,051 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1185 transitions. Word has length 43 [2022-02-16 13:21:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-16 13:21:01,053 INFO L470 AbstractCegarLoop]: Abstraction has 849 states and 1185 transitions. [2022-02-16 13:21:01,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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-02-16 13:21:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1185 transitions. [2022-02-16 13:21:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-16 13:21:01,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-16 13:21:01,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-16 13:21:01,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-16 13:21:01,059 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-02-16 13:21:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 13:21:01,060 INFO L85 PathProgramCache]: Analyzing trace with hash -563524932, now seen corresponding path program 1 times [2022-02-16 13:21:01,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 13:21:01,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076766612] [2022-02-16 13:21:01,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 13:21:01,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 13:21:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 13:21:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 13:21:01,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 13:21:01,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076766612] [2022-02-16 13:21:01,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076766612] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 13:21:01,248 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 13:21:01,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-16 13:21:01,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438369281] [2022-02-16 13:21:01,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 13:21:01,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-16 13:21:01,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 13:21:01,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-16 13:21:01,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-16 13:21:01,252 INFO L87 Difference]: Start difference. First operand 849 states and 1185 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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-02-16 13:21:01,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-16 13:21:01,534 INFO L93 Difference]: Finished difference Result 866 states and 1215 transitions. [2022-02-16 13:21:01,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 13:21:01,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 48 [2022-02-16 13:21:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-16 13:21:01,538 INFO L225 Difference]: With dead ends: 866 [2022-02-16 13:21:01,538 INFO L226 Difference]: Without dead ends: 866 [2022-02-16 13:21:01,538 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-02-16 13:21:01,539 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 56 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-16 13:21:01,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 349 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-16 13:21:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-02-16 13:21:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 857. [2022-02-16 13:21:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 823 states have (on average 1.462940461725395) internal successors, (1204), 856 states have internal predecessors, (1204), 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-02-16 13:21:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1204 transitions. [2022-02-16 13:21:01,554 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1204 transitions. Word has length 48 [2022-02-16 13:21:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-16 13:21:01,554 INFO L470 AbstractCegarLoop]: Abstraction has 857 states and 1204 transitions. [2022-02-16 13:21:01,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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-02-16 13:21:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1204 transitions. [2022-02-16 13:21:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-16 13:21:01,560 INFO L506 BasicCegarLoop]: Found error trace [2022-02-16 13:21:01,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-16 13:21:01,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-16 13:21:01,561 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-02-16 13:21:01,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 13:21:01,562 INFO L85 PathProgramCache]: Analyzing trace with hash -932716891, now seen corresponding path program 1 times [2022-02-16 13:21:01,562 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 13:21:01,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614802938] [2022-02-16 13:21:01,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 13:21:01,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 13:21:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 13:21:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 13:21:01,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 13:21:01,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614802938] [2022-02-16 13:21:01,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614802938] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 13:21:01,696 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 13:21:01,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-16 13:21:01,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409905780] [2022-02-16 13:21:01,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 13:21:01,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-16 13:21:01,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 13:21:01,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-16 13:21:01,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-16 13:21:01,698 INFO L87 Difference]: Start difference. First operand 857 states and 1204 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 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-02-16 13:21:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-16 13:21:01,900 INFO L93 Difference]: Finished difference Result 985 states and 1405 transitions. [2022-02-16 13:21:01,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 13:21:01,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 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 49 [2022-02-16 13:21:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-16 13:21:01,903 INFO L225 Difference]: With dead ends: 985 [2022-02-16 13:21:01,903 INFO L226 Difference]: Without dead ends: 985 [2022-02-16 13:21:01,903 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-02-16 13:21:01,904 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 63 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-16 13:21:01,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 205 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-16 13:21:01,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2022-02-16 13:21:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 916. [2022-02-16 13:21:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 890 states have (on average 1.4764044943820225) internal successors, (1314), 915 states have internal predecessors, (1314), 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-02-16 13:21:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1314 transitions. [2022-02-16 13:21:01,918 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1314 transitions. Word has length 49 [2022-02-16 13:21:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-16 13:21:01,919 INFO L470 AbstractCegarLoop]: Abstraction has 916 states and 1314 transitions. [2022-02-16 13:21:01,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 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-02-16 13:21:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1314 transitions. [2022-02-16 13:21:01,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-16 13:21:01,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-16 13:21:01,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-16 13:21:01,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-16 13:21:01,920 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-02-16 13:21:01,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 13:21:01,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1509049556, now seen corresponding path program 1 times [2022-02-16 13:21:01,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 13:21:01,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453535479] [2022-02-16 13:21:01,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 13:21:01,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 13:21:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 13:21:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 13:21:02,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 13:21:02,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453535479] [2022-02-16 13:21:02,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453535479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 13:21:02,050 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 13:21:02,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-16 13:21:02,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204299432] [2022-02-16 13:21:02,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 13:21:02,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-16 13:21:02,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 13:21:02,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-16 13:21:02,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-16 13:21:02,052 INFO L87 Difference]: Start difference. First operand 916 states and 1314 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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-02-16 13:21:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-16 13:21:02,243 INFO L93 Difference]: Finished difference Result 986 states and 1418 transitions. [2022-02-16 13:21:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 13:21:02,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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 56 [2022-02-16 13:21:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-16 13:21:02,247 INFO L225 Difference]: With dead ends: 986 [2022-02-16 13:21:02,247 INFO L226 Difference]: Without dead ends: 986 [2022-02-16 13:21:02,248 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-02-16 13:21:02,250 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 58 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-16 13:21:02,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 269 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-16 13:21:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2022-02-16 13:21:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 956. [2022-02-16 13:21:02,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 930 states have (on average 1.4989247311827958) internal successors, (1394), 955 states have internal predecessors, (1394), 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-02-16 13:21:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1394 transitions. [2022-02-16 13:21:02,265 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1394 transitions. Word has length 56 [2022-02-16 13:21:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-16 13:21:02,267 INFO L470 AbstractCegarLoop]: Abstraction has 956 states and 1394 transitions. [2022-02-16 13:21:02,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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-02-16 13:21:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1394 transitions. [2022-02-16 13:21:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-16 13:21:02,268 INFO L506 BasicCegarLoop]: Found error trace [2022-02-16 13:21:02,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-16 13:21:02,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-16 13:21:02,268 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-02-16 13:21:02,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 13:21:02,269 INFO L85 PathProgramCache]: Analyzing trace with hash 902304810, now seen corresponding path program 1 times [2022-02-16 13:21:02,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 13:21:02,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904201649] [2022-02-16 13:21:02,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 13:21:02,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 13:21:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 13:21:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 13:21:02,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 13:21:02,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904201649] [2022-02-16 13:21:02,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904201649] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 13:21:02,402 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 13:21:02,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-16 13:21:02,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10150003] [2022-02-16 13:21:02,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 13:21:02,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-16 13:21:02,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 13:21:02,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-16 13:21:02,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-16 13:21:02,404 INFO L87 Difference]: Start difference. First operand 956 states and 1394 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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-02-16 13:21:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-16 13:21:02,603 INFO L93 Difference]: Finished difference Result 1105 states and 1623 transitions. [2022-02-16 13:21:02,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 13:21:02,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 57 [2022-02-16 13:21:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-16 13:21:02,606 INFO L225 Difference]: With dead ends: 1105 [2022-02-16 13:21:02,606 INFO L226 Difference]: Without dead ends: 909 [2022-02-16 13:21:02,607 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-02-16 13:21:02,608 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 58 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-16 13:21:02,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 262 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-16 13:21:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2022-02-16 13:21:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 873. [2022-02-16 13:21:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 852 states have (on average 1.5434272300469483) internal successors, (1315), 872 states have internal predecessors, (1315), 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-02-16 13:21:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1315 transitions. [2022-02-16 13:21:02,625 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1315 transitions. Word has length 57 [2022-02-16 13:21:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-16 13:21:02,626 INFO L470 AbstractCegarLoop]: Abstraction has 873 states and 1315 transitions. [2022-02-16 13:21:02,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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-02-16 13:21:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1315 transitions. [2022-02-16 13:21:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-16 13:21:02,627 INFO L506 BasicCegarLoop]: Found error trace [2022-02-16 13:21:02,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-16 13:21:02,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-16 13:21:02,627 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-02-16 13:21:02,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 13:21:02,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1198407741, now seen corresponding path program 1 times [2022-02-16 13:21:02,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 13:21:02,628 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227536406] [2022-02-16 13:21:02,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 13:21:02,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 13:21:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-16 13:21:02,668 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-16 13:21:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-16 13:21:02,719 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-16 13:21:02,719 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-16 13:21:02,720 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2022-02-16 13:21:02,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2022-02-16 13:21:02,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2022-02-16 13:21:02,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2022-02-16 13:21:02,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2022-02-16 13:21:02,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2022-02-16 13:21:02,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2022-02-16 13:21:02,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (6 of 14 remaining) [2022-02-16 13:21:02,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2022-02-16 13:21:02,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2022-02-16 13:21:02,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2022-02-16 13:21:02,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2022-02-16 13:21:02,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2022-02-16 13:21:02,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2022-02-16 13:21:02,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-16 13:21:02,727 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-16 13:21:02,731 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-16 13:21:02,731 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-16 13:21:02,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 01:21:02 BasicIcfg [2022-02-16 13:21:02,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-16 13:21:02,799 INFO L158 Benchmark]: Toolchain (without parser) took 18881.96ms. Allocated memory was 182.5MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 132.8MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 848.8MB. Max. memory is 8.0GB. [2022-02-16 13:21:02,799 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-16 13:21:02,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.44ms. Allocated memory is still 182.5MB. Free memory was 132.5MB in the beginning and 153.0MB in the end (delta: -20.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-16 13:21:02,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.37ms. Allocated memory is still 182.5MB. Free memory was 153.0MB in the beginning and 150.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-16 13:21:02,800 INFO L158 Benchmark]: Boogie Preprocessor took 45.09ms. Allocated memory is still 182.5MB. Free memory was 150.9MB in the beginning and 149.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-16 13:21:02,800 INFO L158 Benchmark]: RCFGBuilder took 567.12ms. Allocated memory is still 182.5MB. Free memory was 149.4MB in the beginning and 135.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-02-16 13:21:02,800 INFO L158 Benchmark]: TraceAbstraction took 17751.28ms. Allocated memory was 182.5MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 134.7MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 851.0MB. Max. memory is 8.0GB. [2022-02-16 13:21:02,802 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 449.44ms. Allocated memory is still 182.5MB. Free memory was 132.5MB in the beginning and 153.0MB in the end (delta: -20.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.37ms. Allocated memory is still 182.5MB. Free memory was 153.0MB in the beginning and 150.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.09ms. Allocated memory is still 182.5MB. Free memory was 150.9MB in the beginning and 149.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 567.12ms. Allocated memory is still 182.5MB. Free memory was 149.4MB in the beginning and 135.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 17751.28ms. Allocated memory was 182.5MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 134.7MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 851.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0 - 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: 694]: Data race detected Data race detected The following path leads to a data race: [L679] 0 int g; VAL [g={1:0}] [L680] 0 int *g1; VAL [g={1:0}, g1={0:0}] [L681] 0 int *g2; VAL [g={1:0}, g1={0:0}, g2={0:0}] [L682] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [g={1:0}, g1={0:0}, g2={0:0}, mutex={2:0}] [L690] 0 pthread_t id; VAL [g={1:0}, g1={0:0}, g2={0:0}, id={5:0}, mutex={2:0}] [L691] 0 int x; VAL [g={1:0}, g1={0:0}, g2={0:0}, id={5:0}, mutex={2:0}] [L692] EXPR 0 g2 = &g VAL [g={1:0}, g1={0:0}, g2={1:0}, g2 = &g=26, id={5:0}, mutex={2:0}] [L692] 0 g1 = g2 = &g VAL [g={1:0}, g1={1:0}, g1 = g2 = &g=27, g2={1:0}, g2 = &g=26, id={5:0}, mutex={2:0}] [L693] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, id={5:0}, mutex={2:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1] [L694] EXPR 0 *g2 VAL [arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, id={5:0}, mutex={2:0}] [L694] EXPR 0 \read(*g2) VAL [\read(*g2)=0, arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, id={5:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\read(*g2)=0, arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, id={5:0}, mutex={2:0}] [L685] EXPR 1 *g1 VAL [arg={0:0}, arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, mutex={2:0}] [L685] EXPR 1 \read(*g1) VAL [\read(*g1)=0, arg={0:0}, arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, mutex={2:0}] [L685] 1 (*g1)++ VAL [(*g1)++=25, (*g1)++=0, \read(*g1)=0, arg={0:0}, arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [(*g1)++=25, (*g1)++=0, \read(*g1)=0, \read(*g2)=0, arg={0:0}, arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, id={5:0}, mutex={2:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: g1 = g2 = &g [692] * C: g2 = &g [692] * C: (*g1)++ [685] and C: (*g2)++ [694] - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: 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: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 685]: 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: 17.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.4s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.4s, PartialOrderReductionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 356 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 356 mSDsluCounter, 1754 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 875 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 943 IncrementalHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 888 mSDtfsCounter, 943 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114765occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 8 MinimizatonAttempts, 64707 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-02-16 13:21:02,958 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...