/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/10-synch_02-thread_nonunique.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-10 23:55:17,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 23:55:17,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 23:55:18,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 23:55:18,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 23:55:18,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 23:55:18,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 23:55:18,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 23:55:18,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 23:55:18,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 23:55:18,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 23:55:18,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 23:55:18,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 23:55:18,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 23:55:18,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 23:55:18,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 23:55:18,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 23:55:18,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 23:55:18,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 23:55:18,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 23:55:18,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 23:55:18,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 23:55:18,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 23:55:18,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 23:55:18,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 23:55:18,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 23:55:18,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 23:55:18,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 23:55:18,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 23:55:18,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 23:55:18,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 23:55:18,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 23:55:18,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 23:55:18,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 23:55:18,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 23:55:18,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 23:55:18,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 23:55:18,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 23:55:18,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 23:55:18,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 23:55:18,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 23:55:18,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-10 23:55:18,084 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 23:55:18,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 23:55:18,085 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 23:55:18,085 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 23:55:18,085 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 23:55:18,085 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 23:55:18,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 23:55:18,086 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 23:55:18,086 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 23:55:18,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 23:55:18,087 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 23:55:18,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 23:55:18,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 23:55:18,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 23:55:18,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 23:55:18,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 23:55:18,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 23:55:18,087 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 23:55:18,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 23:55:18,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 23:55:18,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 23:55:18,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 23:55:18,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 23:55:18,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 23:55:18,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 23:55:18,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 23:55:18,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 23:55:18,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 23:55:18,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 23:55:18,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 23:55:18,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 23:55:18,089 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 23:55:18,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 23:55:18,090 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-10 23:55:18,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 23:55:18,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 23:55:18,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 23:55:18,266 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 23:55:18,267 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 23:55:18,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/10-synch_02-thread_nonunique.i [2022-02-10 23:55:18,300 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6a8e009/848491387bc846ac8a9ed5465194129a/FLAG8691b518b [2022-02-10 23:55:18,735 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 23:55:18,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/10-synch_02-thread_nonunique.i [2022-02-10 23:55:18,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6a8e009/848491387bc846ac8a9ed5465194129a/FLAG8691b518b [2022-02-10 23:55:18,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6a8e009/848491387bc846ac8a9ed5465194129a [2022-02-10 23:55:18,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 23:55:18,758 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 23:55:18,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 23:55:18,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 23:55:18,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 23:55:18,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:55:18" (1/1) ... [2022-02-10 23:55:18,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e2836aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:18, skipping insertion in model container [2022-02-10 23:55:18,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:55:18" (1/1) ... [2022-02-10 23:55:18,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 23:55:18,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 23:55:19,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 23:55:19,050 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 23:55:19,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 23:55:19,125 INFO L208 MainTranslator]: Completed translation [2022-02-10 23:55:19,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:19 WrapperNode [2022-02-10 23:55:19,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 23:55:19,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 23:55:19,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 23:55:19,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 23:55:19,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:19" (1/1) ... [2022-02-10 23:55:19,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:19" (1/1) ... [2022-02-10 23:55:19,174 INFO L137 Inliner]: procedures = 259, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2022-02-10 23:55:19,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 23:55:19,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 23:55:19,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 23:55:19,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 23:55:19,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:19" (1/1) ... [2022-02-10 23:55:19,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:19" (1/1) ... [2022-02-10 23:55:19,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:19" (1/1) ... [2022-02-10 23:55:19,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:19" (1/1) ... [2022-02-10 23:55:19,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:19" (1/1) ... [2022-02-10 23:55:19,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:19" (1/1) ... [2022-02-10 23:55:19,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:19" (1/1) ... [2022-02-10 23:55:19,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 23:55:19,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 23:55:19,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 23:55:19,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 23:55:19,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:19" (1/1) ... [2022-02-10 23:55:19,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 23:55:19,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:55:19,228 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-10 23:55:19,233 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-10 23:55:19,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 23:55:19,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 23:55:19,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-10 23:55:19,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 23:55:19,259 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-10 23:55:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-10 23:55:19,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 23:55:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 23:55:19,261 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 23:55:19,334 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 23:55:19,335 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 23:55:19,440 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 23:55:19,444 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 23:55:19,445 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-10 23:55:19,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:55:19 BoogieIcfgContainer [2022-02-10 23:55:19,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 23:55:19,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 23:55:19,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 23:55:19,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 23:55:19,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 11:55:18" (1/3) ... [2022-02-10 23:55:19,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4699244b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:55:19, skipping insertion in model container [2022-02-10 23:55:19,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:19" (2/3) ... [2022-02-10 23:55:19,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4699244b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:55:19, skipping insertion in model container [2022-02-10 23:55:19,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:55:19" (3/3) ... [2022-02-10 23:55:19,464 INFO L112 eAbstractionObserver]: Analyzing ICFG 10-synch_02-thread_nonunique.i [2022-02-10 23:55:19,469 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 23:55:19,469 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 23:55:19,469 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-10 23:55:19,469 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 23:55:19,498 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,498 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,498 WARN L322 ript$VariableManager]: TermVariable t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,498 WARN L322 ript$VariableManager]: TermVariable t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,499 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,499 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,499 WARN L322 ript$VariableManager]: TermVariable t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,499 WARN L322 ript$VariableManager]: TermVariable t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,499 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,499 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,499 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,500 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,500 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,500 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,500 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,500 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,500 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,500 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,501 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,501 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,501 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,501 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,504 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,504 WARN L322 ript$VariableManager]: TermVariable t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,504 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,504 WARN L322 ript$VariableManager]: TermVariable t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,504 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:19,507 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-10 23:55:19,539 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 23:55:19,544 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, 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-10 23:55:19,544 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-10 23:55:19,550 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 56 transitions, 120 flow [2022-02-10 23:55:19,581 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 311 states, 302 states have (on average 1.903973509933775) internal successors, (575), 310 states have internal predecessors, (575), 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-10 23:55:19,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 311 states, 302 states have (on average 1.903973509933775) internal successors, (575), 310 states have internal predecessors, (575), 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-10 23:55:19,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-10 23:55:19,586 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:19,587 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:19,587 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2022-02-10 23:55:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:19,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1508681915, now seen corresponding path program 1 times [2022-02-10 23:55:19,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:19,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885009621] [2022-02-10 23:55:19,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:19,723 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-10 23:55:19,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:19,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885009621] [2022-02-10 23:55:19,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885009621] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:19,724 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:19,724 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 23:55:19,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394973114] [2022-02-10 23:55:19,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:19,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-10 23:55:19,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:19,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-10 23:55:19,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 23:55:19,754 INFO L87 Difference]: Start difference. First operand has 311 states, 302 states have (on average 1.903973509933775) internal successors, (575), 310 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-10 23:55:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:19,791 INFO L93 Difference]: Finished difference Result 311 states and 554 transitions. [2022-02-10 23:55:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 23:55:19,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 21 [2022-02-10 23:55:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:19,803 INFO L225 Difference]: With dead ends: 311 [2022-02-10 23:55:19,803 INFO L226 Difference]: Without dead ends: 282 [2022-02-10 23:55:19,804 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 23:55:19,806 INFO L934 BasicCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:19,807 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:55:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-02-10 23:55:19,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-02-10 23:55:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 275 states have (on average 1.8072727272727274) internal successors, (497), 281 states have internal predecessors, (497), 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-10 23:55:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 497 transitions. [2022-02-10 23:55:19,859 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 497 transitions. Word has length 21 [2022-02-10 23:55:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:19,860 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 497 transitions. [2022-02-10 23:55:19,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-10 23:55:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 497 transitions. [2022-02-10 23:55:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-10 23:55:19,860 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:19,860 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:19,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 23:55:19,861 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2022-02-10 23:55:19,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:19,861 INFO L85 PathProgramCache]: Analyzing trace with hash -298772548, now seen corresponding path program 1 times [2022-02-10 23:55:19,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:19,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886248074] [2022-02-10 23:55:19,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:19,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:19,923 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-10 23:55:19,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:19,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886248074] [2022-02-10 23:55:19,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886248074] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:19,923 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:19,923 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 23:55:19,923 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435811319] [2022-02-10 23:55:19,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:19,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:55:19,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:19,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:55:19,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:19,925 INFO L87 Difference]: Start difference. First operand 282 states and 497 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10 23:55:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:19,963 INFO L93 Difference]: Finished difference Result 239 states and 418 transitions. [2022-02-10 23:55:19,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:55:19,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-10 23:55:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:19,964 INFO L225 Difference]: With dead ends: 239 [2022-02-10 23:55:19,964 INFO L226 Difference]: Without dead ends: 239 [2022-02-10 23:55:19,965 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:19,966 INFO L934 BasicCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:19,966 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 56 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:55:19,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-02-10 23:55:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2022-02-10 23:55:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 233 states have (on average 1.793991416309013) internal successors, (418), 238 states have internal predecessors, (418), 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-10 23:55:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 418 transitions. [2022-02-10 23:55:19,973 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 418 transitions. Word has length 21 [2022-02-10 23:55:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:19,974 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 418 transitions. [2022-02-10 23:55:19,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10 23:55:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 418 transitions. [2022-02-10 23:55:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-10 23:55:19,974 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:19,974 INFO L515 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] [2022-02-10 23:55:19,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 23:55:19,975 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2022-02-10 23:55:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1391277118, now seen corresponding path program 1 times [2022-02-10 23:55:19,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:19,975 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346889245] [2022-02-10 23:55:19,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:19,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:20,035 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-10 23:55:20,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:20,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346889245] [2022-02-10 23:55:20,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346889245] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:20,035 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:20,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 23:55:20,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20726423] [2022-02-10 23:55:20,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:20,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:55:20,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:20,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:55:20,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:20,037 INFO L87 Difference]: Start difference. First operand 239 states and 418 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-10 23:55:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:20,047 INFO L93 Difference]: Finished difference Result 218 states and 377 transitions. [2022-02-10 23:55:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:55:20,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-02-10 23:55:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:20,048 INFO L225 Difference]: With dead ends: 218 [2022-02-10 23:55:20,048 INFO L226 Difference]: Without dead ends: 218 [2022-02-10 23:55:20,048 INFO L933 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-10 23:55:20,049 INFO L934 BasicCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:20,050 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 103 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:55:20,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-02-10 23:55:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-02-10 23:55:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 215 states have (on average 1.7534883720930232) internal successors, (377), 217 states have internal predecessors, (377), 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-10 23:55:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 377 transitions. [2022-02-10 23:55:20,055 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 377 transitions. Word has length 22 [2022-02-10 23:55:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:20,055 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 377 transitions. [2022-02-10 23:55:20,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-10 23:55:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 377 transitions. [2022-02-10 23:55:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-10 23:55:20,056 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:20,056 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:20,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 23:55:20,057 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE] === [2022-02-10 23:55:20,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash 499314067, now seen corresponding path program 1 times [2022-02-10 23:55:20,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:20,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566698803] [2022-02-10 23:55:20,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 23:55:20,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-10 23:55:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 23:55:20,131 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-10 23:55:20,131 INFO L629 BasicCegarLoop]: Counterexample is feasible [2022-02-10 23:55:20,132 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 4 remaining) [2022-02-10 23:55:20,133 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 4 remaining) [2022-02-10 23:55:20,133 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 4 remaining) [2022-02-10 23:55:20,133 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2022-02-10 23:55:20,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 23:55:20,136 INFO L733 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-10 23:55:20,136 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-10 23:55:20,136 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-02-10 23:55:20,154 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,154 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,155 WARN L322 ript$VariableManager]: TermVariable t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,155 WARN L322 ript$VariableManager]: TermVariable t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,155 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,155 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,155 WARN L322 ript$VariableManager]: TermVariable t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,155 WARN L322 ript$VariableManager]: TermVariable t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,155 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,155 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,155 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,156 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,156 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,156 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,156 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,156 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,156 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,156 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,156 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,156 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,156 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,157 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,157 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,157 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,157 WARN L322 ript$VariableManager]: TermVariable t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,157 WARN L322 ript$VariableManager]: TermVariable t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,157 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,157 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,157 WARN L322 ript$VariableManager]: TermVariable t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,157 WARN L322 ript$VariableManager]: TermVariable t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,158 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,158 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,158 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,158 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,159 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,160 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,161 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,161 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,161 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,161 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,161 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,161 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,161 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,161 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,162 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,162 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,162 WARN L322 ript$VariableManager]: TermVariable t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,162 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,162 WARN L322 ript$VariableManager]: TermVariable t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,162 WARN L322 ript$VariableManager]: TermVariable t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,162 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,162 WARN L322 ript$VariableManager]: TermVariable t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,163 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,163 WARN L322 ript$VariableManager]: TermVariable |t_funThread2of2ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:20,166 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-10 23:55:20,169 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 23:55:20,175 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, 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-10 23:55:20,176 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-10 23:55:20,177 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 67 transitions, 152 flow [2022-02-10 23:55:20,257 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3341 states, 3316 states have (on average 2.708986731001206) internal successors, (8983), 3340 states have internal predecessors, (8983), 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-10 23:55:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 3341 states, 3316 states have (on average 2.708986731001206) internal successors, (8983), 3340 states have internal predecessors, (8983), 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-10 23:55:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-10 23:55:20,264 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:20,264 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:20,264 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-02-10 23:55:20,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:20,266 INFO L85 PathProgramCache]: Analyzing trace with hash -179665602, now seen corresponding path program 1 times [2022-02-10 23:55:20,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:20,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142239117] [2022-02-10 23:55:20,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:20,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:20,302 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-10 23:55:20,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:20,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142239117] [2022-02-10 23:55:20,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142239117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:20,303 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:20,303 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 23:55:20,303 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504118203] [2022-02-10 23:55:20,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:20,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-10 23:55:20,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:20,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-10 23:55:20,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 23:55:20,310 INFO L87 Difference]: Start difference. First operand has 3341 states, 3316 states have (on average 2.708986731001206) internal successors, (8983), 3340 states have internal predecessors, (8983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-10 23:55:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:20,343 INFO L93 Difference]: Finished difference Result 3341 states and 8752 transitions. [2022-02-10 23:55:20,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 23:55:20,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 21 [2022-02-10 23:55:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:20,366 INFO L225 Difference]: With dead ends: 3341 [2022-02-10 23:55:20,366 INFO L226 Difference]: Without dead ends: 3172 [2022-02-10 23:55:20,366 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 23:55:20,367 INFO L934 BasicCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:20,367 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:55:20,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3172 states. [2022-02-10 23:55:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3172 to 3172. [2022-02-10 23:55:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 3151 states have (on average 2.6350364963503647) internal successors, (8303), 3171 states have internal predecessors, (8303), 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-10 23:55:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 8303 transitions. [2022-02-10 23:55:20,429 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 8303 transitions. Word has length 21 [2022-02-10 23:55:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:20,430 INFO L470 AbstractCegarLoop]: Abstraction has 3172 states and 8303 transitions. [2022-02-10 23:55:20,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-10 23:55:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 8303 transitions. [2022-02-10 23:55:20,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-10 23:55:20,433 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:20,433 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:20,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 23:55:20,434 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-02-10 23:55:20,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:20,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1987120065, now seen corresponding path program 1 times [2022-02-10 23:55:20,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:20,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349584124] [2022-02-10 23:55:20,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:20,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:20,480 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-10 23:55:20,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:20,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349584124] [2022-02-10 23:55:20,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349584124] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:20,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:20,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 23:55:20,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6742113] [2022-02-10 23:55:20,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:20,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:55:20,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:20,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:55:20,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:20,482 INFO L87 Difference]: Start difference. First operand 3172 states and 8303 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10 23:55:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:20,558 INFO L93 Difference]: Finished difference Result 2676 states and 6842 transitions. [2022-02-10 23:55:20,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:55:20,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-10 23:55:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:20,568 INFO L225 Difference]: With dead ends: 2676 [2022-02-10 23:55:20,568 INFO L226 Difference]: Without dead ends: 2676 [2022-02-10 23:55:20,568 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:20,569 INFO L934 BasicCegarLoop]: 58 mSDtfsCounter, 38 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:20,569 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 99 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:55:20,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2022-02-10 23:55:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2589. [2022-02-10 23:55:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2589 states, 2571 states have (on average 2.601711396343835) internal successors, (6689), 2588 states have internal predecessors, (6689), 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-10 23:55:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 6689 transitions. [2022-02-10 23:55:20,634 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 6689 transitions. Word has length 21 [2022-02-10 23:55:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:20,634 INFO L470 AbstractCegarLoop]: Abstraction has 2589 states and 6689 transitions. [2022-02-10 23:55:20,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10 23:55:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 6689 transitions. [2022-02-10 23:55:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-10 23:55:20,637 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:20,637 INFO L515 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] [2022-02-10 23:55:20,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 23:55:20,637 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-02-10 23:55:20,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:20,637 INFO L85 PathProgramCache]: Analyzing trace with hash 849774069, now seen corresponding path program 1 times [2022-02-10 23:55:20,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:20,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064619989] [2022-02-10 23:55:20,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:20,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:55:20,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:20,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064619989] [2022-02-10 23:55:20,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064619989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:20,659 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:20,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 23:55:20,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139496351] [2022-02-10 23:55:20,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:20,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:55:20,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:20,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:55:20,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:20,660 INFO L87 Difference]: Start difference. First operand 2589 states and 6689 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-10 23:55:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:20,721 INFO L93 Difference]: Finished difference Result 2778 states and 7177 transitions. [2022-02-10 23:55:20,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:55:20,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-02-10 23:55:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:20,733 INFO L225 Difference]: With dead ends: 2778 [2022-02-10 23:55:20,734 INFO L226 Difference]: Without dead ends: 2743 [2022-02-10 23:55:20,734 INFO L933 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-10 23:55:20,734 INFO L934 BasicCegarLoop]: 98 mSDtfsCounter, 42 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:20,735 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 151 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:55:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2022-02-10 23:55:20,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 2599. [2022-02-10 23:55:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2599 states, 2581 states have (on average 2.606354126307633) internal successors, (6727), 2598 states have internal predecessors, (6727), 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-10 23:55:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 6727 transitions. [2022-02-10 23:55:20,812 INFO L78 Accepts]: Start accepts. Automaton has 2599 states and 6727 transitions. Word has length 22 [2022-02-10 23:55:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:20,812 INFO L470 AbstractCegarLoop]: Abstraction has 2599 states and 6727 transitions. [2022-02-10 23:55:20,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-10 23:55:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 6727 transitions. [2022-02-10 23:55:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-10 23:55:20,813 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:20,813 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:20,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 23:55:20,813 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-02-10 23:55:20,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:20,814 INFO L85 PathProgramCache]: Analyzing trace with hash 63309174, now seen corresponding path program 1 times [2022-02-10 23:55:20,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:20,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608731504] [2022-02-10 23:55:20,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:20,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:55:20,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:20,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608731504] [2022-02-10 23:55:20,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608731504] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:55:20,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039010736] [2022-02-10 23:55:20,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:20,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:55:20,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:55:20,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:55:20,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-10 23:55:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:20,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-10 23:55:20,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:55:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:55:21,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:55:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:55:21,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039010736] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:55:21,126 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:55:21,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-10 23:55:21,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686247990] [2022-02-10 23:55:21,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:55:21,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:55:21,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:21,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:55:21,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:55:21,127 INFO L87 Difference]: Start difference. First operand 2599 states and 6727 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-10 23:55:21,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:21,198 INFO L93 Difference]: Finished difference Result 1229 states and 3220 transitions. [2022-02-10 23:55:21,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 23:55:21,198 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 31 [2022-02-10 23:55:21,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:21,203 INFO L225 Difference]: With dead ends: 1229 [2022-02-10 23:55:21,203 INFO L226 Difference]: Without dead ends: 1229 [2022-02-10 23:55:21,203 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-02-10 23:55:21,205 INFO L934 BasicCegarLoop]: 54 mSDtfsCounter, 201 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:21,205 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 256 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:55:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2022-02-10 23:55:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1229. [2022-02-10 23:55:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1225 states have (on average 2.6285714285714286) internal successors, (3220), 1228 states have internal predecessors, (3220), 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-10 23:55:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 3220 transitions. [2022-02-10 23:55:21,226 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 3220 transitions. Word has length 31 [2022-02-10 23:55:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:21,227 INFO L470 AbstractCegarLoop]: Abstraction has 1229 states and 3220 transitions. [2022-02-10 23:55:21,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-10 23:55:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 3220 transitions. [2022-02-10 23:55:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-10 23:55:21,228 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:21,228 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:21,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-10 23:55:21,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:55:21,440 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-02-10 23:55:21,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:21,440 INFO L85 PathProgramCache]: Analyzing trace with hash 25788934, now seen corresponding path program 1 times [2022-02-10 23:55:21,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:21,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508235351] [2022-02-10 23:55:21,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:21,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-10 23:55:21,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:21,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508235351] [2022-02-10 23:55:21,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508235351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:21,472 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:21,472 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 23:55:21,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358735558] [2022-02-10 23:55:21,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:21,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:55:21,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:21,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:55:21,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:21,472 INFO L87 Difference]: Start difference. First operand 1229 states and 3220 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-10 23:55:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:21,490 INFO L93 Difference]: Finished difference Result 1262 states and 3294 transitions. [2022-02-10 23:55:21,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:55:21,490 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 32 [2022-02-10 23:55:21,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:21,495 INFO L225 Difference]: With dead ends: 1262 [2022-02-10 23:55:21,495 INFO L226 Difference]: Without dead ends: 1262 [2022-02-10 23:55:21,495 INFO L933 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-10 23:55:21,496 INFO L934 BasicCegarLoop]: 55 mSDtfsCounter, 19 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:21,496 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 87 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:55:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2022-02-10 23:55:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1207. [2022-02-10 23:55:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1204 states have (on average 2.612126245847176) internal successors, (3145), 1206 states have internal predecessors, (3145), 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-10 23:55:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 3145 transitions. [2022-02-10 23:55:21,516 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 3145 transitions. Word has length 32 [2022-02-10 23:55:21,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:21,517 INFO L470 AbstractCegarLoop]: Abstraction has 1207 states and 3145 transitions. [2022-02-10 23:55:21,517 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-10 23:55:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 3145 transitions. [2022-02-10 23:55:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-10 23:55:21,519 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:21,519 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:21,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 23:55:21,519 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2022-02-10 23:55:21,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1212973435, now seen corresponding path program 1 times [2022-02-10 23:55:21,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:21,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530367331] [2022-02-10 23:55:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 23:55:21,528 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-10 23:55:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 23:55:21,536 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-10 23:55:21,536 INFO L629 BasicCegarLoop]: Counterexample is feasible [2022-02-10 23:55:21,536 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 5 remaining) [2022-02-10 23:55:21,536 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2022-02-10 23:55:21,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-02-10 23:55:21,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2022-02-10 23:55:21,537 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2022-02-10 23:55:21,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-10 23:55:21,537 INFO L733 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-10 23:55:21,540 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2022-02-10 23:55:21,540 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 23:55:21,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 11:55:21 BasicIcfg [2022-02-10 23:55:21,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 23:55:21,564 INFO L158 Benchmark]: Toolchain (without parser) took 2806.69ms. Allocated memory was 179.3MB in the beginning and 224.4MB in the end (delta: 45.1MB). Free memory was 126.3MB in the beginning and 75.6MB in the end (delta: 50.7MB). Peak memory consumption was 95.4MB. Max. memory is 8.0GB. [2022-02-10 23:55:21,564 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 179.3MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 23:55:21,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.16ms. Allocated memory is still 179.3MB. Free memory was 126.2MB in the beginning and 138.0MB in the end (delta: -11.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-10 23:55:21,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.77ms. Allocated memory is still 179.3MB. Free memory was 138.0MB in the beginning and 135.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 23:55:21,565 INFO L158 Benchmark]: Boogie Preprocessor took 20.74ms. Allocated memory is still 179.3MB. Free memory was 135.9MB in the beginning and 134.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-10 23:55:21,565 INFO L158 Benchmark]: RCFGBuilder took 250.08ms. Allocated memory is still 179.3MB. Free memory was 134.3MB in the beginning and 122.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-10 23:55:21,565 INFO L158 Benchmark]: TraceAbstraction took 2117.11ms. Allocated memory was 179.3MB in the beginning and 224.4MB in the end (delta: 45.1MB). Free memory was 122.3MB in the beginning and 75.6MB in the end (delta: 46.7MB). Peak memory consumption was 92.3MB. Max. memory is 8.0GB. [2022-02-10 23:55:21,568 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.17ms. Allocated memory is still 179.3MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 367.16ms. Allocated memory is still 179.3MB. Free memory was 126.2MB in the beginning and 138.0MB in the end (delta: -11.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.77ms. Allocated memory is still 179.3MB. Free memory was 138.0MB in the beginning and 135.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.74ms. Allocated memory is still 179.3MB. Free memory was 135.9MB in the beginning and 134.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 250.08ms. Allocated memory is still 179.3MB. Free memory was 134.3MB in the beginning and 122.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2117.11ms. Allocated memory was 179.3MB in the beginning and 224.4MB in the end (delta: 45.1MB). Free memory was 122.3MB in the beginning and 75.6MB in the end (delta: 46.7MB). Peak memory consumption was 92.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 919]: Data race detected Data race detected The following path leads to a data race: [L917] 0 int myglobal; VAL [myglobal=0] [L923] 0 pthread_t id[10]; VAL [id={2:0}, myglobal=0] [L924] 0 int i; VAL [id={2:0}, myglobal=0] [L925] 0 i=0 VAL [i=0, id={2:0}, myglobal=0] [L925] COND TRUE 0 i<10 VAL [i=0, id={2:0}, myglobal=0] [L926] FCALL, FORK 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, i=0, id={2:0}, myglobal=0, pthread_create(&id[i], ((void *)0), t_fun, ((void *)0))=-1] [L919] 1 myglobal=42 VAL [arg={0:0}, arg={0:0}, myglobal=42, myglobal=42=43] [L925] 0 i++ VAL [arg={0:0}, arg={0:0}, i=1, id={2:0}, myglobal=42, myglobal=42=43] [L925] COND TRUE 0 i<10 VAL [arg={0:0}, arg={0:0}, i=1, id={2:0}, myglobal=42, myglobal=42=43] [L926] FCALL, FORK 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=1, id={2:0}, myglobal=42, myglobal=42=43, pthread_create(&id[i], ((void *)0), t_fun, ((void *)0))=0] [L919] 2 myglobal=42 VAL [arg={0:0}, arg={0:0}, myglobal=42, myglobal=42=44] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. - UnprovableResult [Line: 928]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 926]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 64 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 148 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=311occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 65 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 74 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 654 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 341 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 326 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3341occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 286 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 SizeOfPredicates, 2 NumberOfNonLiveVariables, 76 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 5/8 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-10 23:55:21,649 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...