/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:13:42,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:13:42,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:13:42,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:13:42,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:13:42,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:13:42,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:13:42,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:13:42,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:13:42,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:13:42,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:13:42,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:13:42,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:13:42,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:13:42,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:13:42,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:13:42,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:13:42,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:13:42,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:13:42,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:13:42,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:13:42,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:13:42,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:13:42,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:13:42,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:13:42,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:13:42,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:13:42,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:13:42,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:13:42,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:13:42,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:13:42,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:13:42,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:13:42,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:13:42,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:13:42,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:13:42,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:13:42,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:13:42,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:13:42,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:13:42,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:13:42,190 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:13:42,221 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:13:42,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:13:42,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:13:42,222 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:13:42,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:13:42,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:13:42,223 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:13:42,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:13:42,224 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:13:42,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:13:42,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:13:42,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:13:42,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:13:42,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:13:42,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:13:42,225 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:13:42,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:13:42,226 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:13:42,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:13:42,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:13:42,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:13:42,226 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:13:42,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:13:42,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:13:42,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:13:42,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:13:42,227 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:13:42,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:13:42,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:13:42,228 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:13:42,228 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:13:42,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:13:42,228 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-15 20:13:42,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:13:42,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:13:42,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:13:42,464 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 20:13:42,467 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 20:13:42,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2022-03-15 20:13:42,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f304401/34f63b2135dc4955894a5e6beed61105/FLAGca6aaa125 [2022-03-15 20:13:43,018 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 20:13:43,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2022-03-15 20:13:43,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f304401/34f63b2135dc4955894a5e6beed61105/FLAGca6aaa125 [2022-03-15 20:13:43,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f304401/34f63b2135dc4955894a5e6beed61105 [2022-03-15 20:13:43,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:13:43,561 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 20:13:43,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 20:13:43,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 20:13:43,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 20:13:43,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:13:43" (1/1) ... [2022-03-15 20:13:43,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309c468a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:43, skipping insertion in model container [2022-03-15 20:13:43,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:13:43" (1/1) ... [2022-03-15 20:13:43,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 20:13:43,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 20:13:44,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:13:44,269 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 20:13:44,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:13:44,401 INFO L208 MainTranslator]: Completed translation [2022-03-15 20:13:44,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:44 WrapperNode [2022-03-15 20:13:44,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 20:13:44,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:13:44,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:13:44,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:13:44,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:44" (1/1) ... [2022-03-15 20:13:44,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:44" (1/1) ... [2022-03-15 20:13:44,467 INFO L137 Inliner]: procedures = 368, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 184 [2022-03-15 20:13:44,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:13:44,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:13:44,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:13:44,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:13:44,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:44" (1/1) ... [2022-03-15 20:13:44,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:44" (1/1) ... [2022-03-15 20:13:44,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:44" (1/1) ... [2022-03-15 20:13:44,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:44" (1/1) ... [2022-03-15 20:13:44,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:44" (1/1) ... [2022-03-15 20:13:44,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:44" (1/1) ... [2022-03-15 20:13:44,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:44" (1/1) ... [2022-03-15 20:13:44,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:13:44,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:13:44,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:13:44,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:13:44,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:44" (1/1) ... [2022-03-15 20:13:44,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:13:44,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:44,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 20:13:44,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 20:13:44,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 20:13:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-15 20:13:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 20:13:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 20:13:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 20:13:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 20:13:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 20:13:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 20:13:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-15 20:13:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 20:13:44,590 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 20:13:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 20:13:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:13:44,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:13:44,592 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:13:44,699 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:13:44,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:13:45,204 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:13:45,226 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:13:45,226 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:13:45,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:13:45 BoogieIcfgContainer [2022-03-15 20:13:45,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:13:45,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:13:45,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:13:45,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:13:45,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 08:13:43" (1/3) ... [2022-03-15 20:13:45,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c39a568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:13:45, skipping insertion in model container [2022-03-15 20:13:45,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:44" (2/3) ... [2022-03-15 20:13:45,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c39a568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:13:45, skipping insertion in model container [2022-03-15 20:13:45,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:13:45" (3/3) ... [2022-03-15 20:13:45,237 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2022-03-15 20:13:45,245 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:13:45,246 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:13:45,246 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-03-15 20:13:45,246 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:13:45,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,323 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,323 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,324 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,324 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,325 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,325 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,325 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,325 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,325 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,326 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,326 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,326 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,326 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,327 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,327 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,327 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,329 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,329 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,333 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,333 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,333 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,333 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,334 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,334 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,334 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,334 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,334 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,334 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,335 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,335 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,335 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,335 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,336 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,336 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,336 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,336 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,336 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,336 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,336 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,337 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,337 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,337 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,337 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,337 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,337 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,338 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,338 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,338 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,338 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,339 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,339 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,339 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,339 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,339 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,341 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,341 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,341 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,341 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,342 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,342 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,345 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,355 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,355 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,355 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,355 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,355 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,356 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,356 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,356 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,356 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,358 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,358 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,358 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,358 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,358 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,358 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,358 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,359 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,359 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,359 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,359 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,360 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,360 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,360 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,360 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,360 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,360 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,363 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,363 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,363 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,363 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,363 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,363 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,364 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,364 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,364 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,364 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,365 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,365 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,365 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,365 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,365 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,365 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,368 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,368 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,368 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,368 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,368 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,368 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,368 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,368 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,370 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,378 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,379 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,379 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,388 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:45,390 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 20:13:45,430 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:13:45,436 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:13:45,436 INFO L340 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2022-03-15 20:13:45,449 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:13:45,457 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 290 places, 286 transitions, 577 flow [2022-03-15 20:13:45,459 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 290 places, 286 transitions, 577 flow [2022-03-15 20:13:45,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 290 places, 286 transitions, 577 flow [2022-03-15 20:13:45,545 INFO L129 PetriNetUnfolder]: 0/285 cut-off events. [2022-03-15 20:13:45,545 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 20:13:45,547 INFO L84 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 285 events. 0/285 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 155 event pairs, 0 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-03-15 20:13:45,553 INFO L116 LiptonReduction]: Number of co-enabled transitions 7728 [2022-03-15 20:14:25,656 WARN L228 SmtUtils]: Spent 8.98s on a formula simplification. DAG size of input: 172 DAG size of output: 163 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:14:37,848 WARN L228 SmtUtils]: Spent 9.59s on a formula simplification. DAG size of input: 172 DAG size of output: 163 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:14:59,201 WARN L228 SmtUtils]: Spent 18.74s on a formula simplification that was a NOOP. DAG size: 203 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:15:14,548 WARN L228 SmtUtils]: Spent 15.34s on a formula simplification that was a NOOP. DAG size: 188 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:15:35,478 WARN L228 SmtUtils]: Spent 20.93s on a formula simplification that was a NOOP. DAG size: 203 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:15:51,844 WARN L228 SmtUtils]: Spent 16.36s on a formula simplification that was a NOOP. DAG size: 188 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:16:03,942 WARN L228 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 242 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:16:26,050 WARN L228 SmtUtils]: Spent 14.56s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:16:46,222 WARN L228 SmtUtils]: Spent 20.13s on a formula simplification. DAG size of input: 297 DAG size of output: 295 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:16:55,817 WARN L228 SmtUtils]: Spent 9.59s on a formula simplification that was a NOOP. DAG size: 287 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:17:18,751 WARN L228 SmtUtils]: Spent 22.93s on a formula simplification. DAG size of input: 297 DAG size of output: 295 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:17:29,811 WARN L228 SmtUtils]: Spent 11.06s on a formula simplification that was a NOOP. DAG size: 287 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:18:46,932 WARN L228 SmtUtils]: Spent 1.29m on a formula simplification. DAG size of input: 370 DAG size of output: 368 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:19:12,572 WARN L228 SmtUtils]: Spent 25.64s on a formula simplification that was a NOOP. DAG size: 358 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:22:51,196 WARN L228 SmtUtils]: Spent 3.64m on a formula simplification. DAG size of input: 370 DAG size of output: 368 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:24:42,711 WARN L228 SmtUtils]: Spent 1.86m on a formula simplification that was a NOOP. DAG size: 358 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:24:42,715 INFO L131 LiptonReduction]: Checked pairs total: 88625 [2022-03-15 20:24:42,716 INFO L133 LiptonReduction]: Total number of compositions: 280 [2022-03-15 20:24:42,724 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 103 transitions, 211 flow [2022-03-15 20:24:42,823 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1923 states, 1847 states have (on average 2.0259880887926367) internal successors, (3742), 1922 states have internal predecessors, (3742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 1923 states, 1847 states have (on average 2.0259880887926367) internal successors, (3742), 1922 states have internal predecessors, (3742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-03-15 20:24:42,833 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:42,833 INFO L514 BasicCegarLoop]: trace histogram [1] [2022-03-15 20:24:42,834 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:24:42,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:42,840 INFO L85 PathProgramCache]: Analyzing trace with hash 938, now seen corresponding path program 1 times [2022-03-15 20:24:42,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:42,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463432359] [2022-03-15 20:24:42,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:42,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:42,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:42,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463432359] [2022-03-15 20:24:42,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463432359] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:42,997 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:42,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-03-15 20:24:42,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1750696192] [2022-03-15 20:24:42,999 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:43,000 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:43,005 INFO L252 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2022-03-15 20:24:43,005 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:43,009 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:43,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 20:24:43,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:43,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 20:24:43,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:24:43,039 INFO L87 Difference]: Start difference. First operand has 1923 states, 1847 states have (on average 2.0259880887926367) internal successors, (3742), 1922 states have internal predecessors, (3742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:43,437 INFO L93 Difference]: Finished difference Result 1909 states and 3728 transitions. [2022-03-15 20:24:43,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 20:24:43,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-03-15 20:24:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:43,469 INFO L225 Difference]: With dead ends: 1909 [2022-03-15 20:24:43,470 INFO L226 Difference]: Without dead ends: 1909 [2022-03-15 20:24:43,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:24:43,477 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:43,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:24:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2022-03-15 20:24:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1909. [2022-03-15 20:24:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1909 states, 1847 states have (on average 2.018408229561451) internal successors, (3728), 1908 states have internal predecessors, (3728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 3728 transitions. [2022-03-15 20:24:43,601 INFO L78 Accepts]: Start accepts. Automaton has 1909 states and 3728 transitions. Word has length 1 [2022-03-15 20:24:43,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:43,601 INFO L470 AbstractCegarLoop]: Abstraction has 1909 states and 3728 transitions. [2022-03-15 20:24:43,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:43,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 3728 transitions. [2022-03-15 20:24:43,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-03-15 20:24:43,602 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:43,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-03-15 20:24:43,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:24:43,603 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:24:43,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:43,606 INFO L85 PathProgramCache]: Analyzing trace with hash 902803566, now seen corresponding path program 1 times [2022-03-15 20:24:43,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:43,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855976876] [2022-03-15 20:24:43,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:43,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:43,952 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:43,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855976876] [2022-03-15 20:24:43,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855976876] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:43,952 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:43,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:24:43,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1496258190] [2022-03-15 20:24:43,952 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:43,953 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:43,953 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2022-03-15 20:24:43,953 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:43,954 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:43,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:24:43,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:43,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:24:43,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:24:43,955 INFO L87 Difference]: Start difference. First operand 1909 states and 3728 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:44,192 INFO L93 Difference]: Finished difference Result 1822 states and 3556 transitions. [2022-03-15 20:24:44,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:24:44,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-03-15 20:24:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:44,201 INFO L225 Difference]: With dead ends: 1822 [2022-03-15 20:24:44,201 INFO L226 Difference]: Without dead ends: 1822 [2022-03-15 20:24:44,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:24:44,203 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:44,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 58 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:24:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2022-03-15 20:24:44,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2022-03-15 20:24:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1775 states have (on average 2.003380281690141) internal successors, (3556), 1821 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 3556 transitions. [2022-03-15 20:24:44,246 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 3556 transitions. Word has length 5 [2022-03-15 20:24:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:44,246 INFO L470 AbstractCegarLoop]: Abstraction has 1822 states and 3556 transitions. [2022-03-15 20:24:44,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 3556 transitions. [2022-03-15 20:24:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:24:44,247 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:44,248 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:44,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:24:44,248 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:24:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:44,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1288383970, now seen corresponding path program 1 times [2022-03-15 20:24:44,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:44,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529495900] [2022-03-15 20:24:44,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:44,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:44,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:44,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529495900] [2022-03-15 20:24:44,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529495900] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:44,466 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:44,466 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:24:44,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1999201633] [2022-03-15 20:24:44,466 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:44,467 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:44,470 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2022-03-15 20:24:44,471 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:44,471 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:44,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:24:44,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:44,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:24:44,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:44,473 INFO L87 Difference]: Start difference. First operand 1822 states and 3556 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:45,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:45,895 INFO L93 Difference]: Finished difference Result 2756 states and 5362 transitions. [2022-03-15 20:24:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:24:45,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2022-03-15 20:24:45,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:45,907 INFO L225 Difference]: With dead ends: 2756 [2022-03-15 20:24:45,908 INFO L226 Difference]: Without dead ends: 2756 [2022-03-15 20:24:45,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:45,909 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 108 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:45,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 108 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 20:24:45,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2022-03-15 20:24:45,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 1892. [2022-03-15 20:24:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1852 states have (on average 1.994060475161987) internal successors, (3693), 1891 states have internal predecessors, (3693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 3693 transitions. [2022-03-15 20:24:45,957 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 3693 transitions. Word has length 10 [2022-03-15 20:24:45,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:45,958 INFO L470 AbstractCegarLoop]: Abstraction has 1892 states and 3693 transitions. [2022-03-15 20:24:45,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:45,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 3693 transitions. [2022-03-15 20:24:45,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:24:45,959 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:45,959 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:45,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:24:45,959 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:24:45,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:45,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1896852190, now seen corresponding path program 1 times [2022-03-15 20:24:45,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:45,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688729024] [2022-03-15 20:24:45,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:45,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:46,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:46,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:46,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688729024] [2022-03-15 20:24:46,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688729024] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:46,112 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:46,112 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:24:46,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [861821566] [2022-03-15 20:24:46,112 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:46,114 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:46,116 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2022-03-15 20:24:46,116 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:46,116 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:46,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:24:46,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:24:46,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:46,118 INFO L87 Difference]: Start difference. First operand 1892 states and 3693 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:47,045 INFO L93 Difference]: Finished difference Result 1855 states and 3620 transitions. [2022-03-15 20:24:47,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:24:47,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2022-03-15 20:24:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:47,052 INFO L225 Difference]: With dead ends: 1855 [2022-03-15 20:24:47,053 INFO L226 Difference]: Without dead ends: 1855 [2022-03-15 20:24:47,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:47,054 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 86 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:47,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 123 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:24:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2022-03-15 20:24:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1855. [2022-03-15 20:24:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1855 states, 1820 states have (on average 1.989010989010989) internal successors, (3620), 1854 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 3620 transitions. [2022-03-15 20:24:47,092 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 3620 transitions. Word has length 15 [2022-03-15 20:24:47,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:47,092 INFO L470 AbstractCegarLoop]: Abstraction has 1855 states and 3620 transitions. [2022-03-15 20:24:47,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 3620 transitions. [2022-03-15 20:24:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:24:47,094 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:47,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:47,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 20:24:47,094 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:24:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1203550630, now seen corresponding path program 1 times [2022-03-15 20:24:47,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:47,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868213030] [2022-03-15 20:24:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:47,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:47,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:47,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868213030] [2022-03-15 20:24:47,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868213030] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:47,226 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:47,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:24:47,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1240614039] [2022-03-15 20:24:47,226 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:47,228 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:47,230 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2022-03-15 20:24:47,231 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:47,231 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:47,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:24:47,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:47,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:24:47,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:47,232 INFO L87 Difference]: Start difference. First operand 1855 states and 3620 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:48,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:48,110 INFO L93 Difference]: Finished difference Result 2503 states and 4863 transitions. [2022-03-15 20:24:48,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:24:48,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-03-15 20:24:48,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:48,121 INFO L225 Difference]: With dead ends: 2503 [2022-03-15 20:24:48,121 INFO L226 Difference]: Without dead ends: 2491 [2022-03-15 20:24:48,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:48,122 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 114 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:48,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 80 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:24:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491 states. [2022-03-15 20:24:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2491 to 2061. [2022-03-15 20:24:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2061 states, 2026 states have (on average 1.985192497532083) internal successors, (4022), 2060 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 4022 transitions. [2022-03-15 20:24:48,195 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 4022 transitions. Word has length 17 [2022-03-15 20:24:48,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:48,195 INFO L470 AbstractCegarLoop]: Abstraction has 2061 states and 4022 transitions. [2022-03-15 20:24:48,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 4022 transitions. [2022-03-15 20:24:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:24:48,197 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:48,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:48,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 20:24:48,197 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:24:48,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:48,198 INFO L85 PathProgramCache]: Analyzing trace with hash -951092680, now seen corresponding path program 1 times [2022-03-15 20:24:48,199 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:48,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930642157] [2022-03-15 20:24:48,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:48,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:48,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:48,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930642157] [2022-03-15 20:24:48,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930642157] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:48,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:48,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:24:48,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [872053803] [2022-03-15 20:24:48,345 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:48,348 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:48,352 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2022-03-15 20:24:48,352 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:48,353 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:48,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:24:48,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:48,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:24:48,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:48,354 INFO L87 Difference]: Start difference. First operand 2061 states and 4022 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-03-15 20:24:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:49,233 INFO L93 Difference]: Finished difference Result 2185 states and 4266 transitions. [2022-03-15 20:24:49,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:24:49,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-03-15 20:24:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:49,244 INFO L225 Difference]: With dead ends: 2185 [2022-03-15 20:24:49,244 INFO L226 Difference]: Without dead ends: 2185 [2022-03-15 20:24:49,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:49,245 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 84 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:49,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 128 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:24:49,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-03-15 20:24:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2185. [2022-03-15 20:24:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2185 states, 2150 states have (on average 1.9841860465116279) internal successors, (4266), 2184 states have internal predecessors, (4266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 4266 transitions. [2022-03-15 20:24:49,292 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 4266 transitions. Word has length 21 [2022-03-15 20:24:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:49,293 INFO L470 AbstractCegarLoop]: Abstraction has 2185 states and 4266 transitions. [2022-03-15 20:24:49,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-03-15 20:24:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 4266 transitions. [2022-03-15 20:24:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:24:49,294 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:49,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:49,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:24:49,294 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:24:49,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:49,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1082562647, now seen corresponding path program 1 times [2022-03-15 20:24:49,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:49,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544036858] [2022-03-15 20:24:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:49,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:49,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:49,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544036858] [2022-03-15 20:24:49,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544036858] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:49,369 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:49,369 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:24:49,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1738484404] [2022-03-15 20:24:49,370 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:49,372 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:49,375 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2022-03-15 20:24:49,375 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:49,375 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:49,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:24:49,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:49,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:24:49,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:24:49,376 INFO L87 Difference]: Start difference. First operand 2185 states and 4266 transitions. Second operand has 3 states, 2 states have (on average 10.5) 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-03-15 20:24:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:49,608 INFO L93 Difference]: Finished difference Result 2086 states and 4070 transitions. [2022-03-15 20:24:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:24:49,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) 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-03-15 20:24:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:49,616 INFO L225 Difference]: With dead ends: 2086 [2022-03-15 20:24:49,616 INFO L226 Difference]: Without dead ends: 2086 [2022-03-15 20:24:49,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:24:49,617 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:49,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 55 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:24:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2022-03-15 20:24:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2086. [2022-03-15 20:24:49,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2086 states, 2062 states have (on average 1.973811833171678) internal successors, (4070), 2085 states have internal predecessors, (4070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 4070 transitions. [2022-03-15 20:24:49,659 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 4070 transitions. Word has length 21 [2022-03-15 20:24:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:49,660 INFO L470 AbstractCegarLoop]: Abstraction has 2086 states and 4070 transitions. [2022-03-15 20:24:49,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) 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-03-15 20:24:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 4070 transitions. [2022-03-15 20:24:49,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:24:49,661 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:49,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:49,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 20:24:49,661 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:24:49,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:49,662 INFO L85 PathProgramCache]: Analyzing trace with hash 976370324, now seen corresponding path program 1 times [2022-03-15 20:24:49,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:49,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897299745] [2022-03-15 20:24:49,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:49,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:49,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:49,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897299745] [2022-03-15 20:24:49,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897299745] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:49,734 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:49,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:24:49,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1172815] [2022-03-15 20:24:49,735 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:49,738 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:49,746 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 54 transitions. [2022-03-15 20:24:49,746 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:49,821 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:49,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:24:49,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:49,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:24:49,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:24:49,822 INFO L87 Difference]: Start difference. First operand 2086 states and 4070 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) 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-03-15 20:24:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:50,224 INFO L93 Difference]: Finished difference Result 1519 states and 2868 transitions. [2022-03-15 20:24:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:24:50,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) 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 26 [2022-03-15 20:24:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:50,230 INFO L225 Difference]: With dead ends: 1519 [2022-03-15 20:24:50,230 INFO L226 Difference]: Without dead ends: 1519 [2022-03-15 20:24:50,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:24:50,231 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 70 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:50,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 140 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:24:50,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2022-03-15 20:24:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1485. [2022-03-15 20:24:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1467 states have (on average 1.9318336741649624) internal successors, (2834), 1484 states have internal predecessors, (2834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2834 transitions. [2022-03-15 20:24:50,259 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2834 transitions. Word has length 26 [2022-03-15 20:24:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:50,259 INFO L470 AbstractCegarLoop]: Abstraction has 1485 states and 2834 transitions. [2022-03-15 20:24:50,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) 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-03-15 20:24:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2834 transitions. [2022-03-15 20:24:50,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 20:24:50,260 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:50,260 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:50,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 20:24:50,260 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:24:50,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:50,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1224111680, now seen corresponding path program 1 times [2022-03-15 20:24:50,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:50,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673800891] [2022-03-15 20:24:50,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:50,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:50,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:50,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673800891] [2022-03-15 20:24:50,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673800891] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:50,386 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:50,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:24:50,386 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [76037221] [2022-03-15 20:24:50,386 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:50,390 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:50,394 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 27 transitions. [2022-03-15 20:24:50,394 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:50,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:50,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:24:50,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:50,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:24:50,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:50,396 INFO L87 Difference]: Start difference. First operand 1485 states and 2834 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:51,272 INFO L93 Difference]: Finished difference Result 1654 states and 3132 transitions. [2022-03-15 20:24:51,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:24:51,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 27 [2022-03-15 20:24:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:51,279 INFO L225 Difference]: With dead ends: 1654 [2022-03-15 20:24:51,279 INFO L226 Difference]: Without dead ends: 1604 [2022-03-15 20:24:51,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:51,280 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 148 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:51,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 101 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:24:51,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2022-03-15 20:24:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1454. [2022-03-15 20:24:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1439 states have (on average 1.9152189020152883) internal successors, (2756), 1453 states have internal predecessors, (2756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2756 transitions. [2022-03-15 20:24:51,309 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2756 transitions. Word has length 27 [2022-03-15 20:24:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:51,309 INFO L470 AbstractCegarLoop]: Abstraction has 1454 states and 2756 transitions. [2022-03-15 20:24:51,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2756 transitions. [2022-03-15 20:24:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 20:24:51,310 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:51,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:51,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 20:24:51,311 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:24:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:51,311 INFO L85 PathProgramCache]: Analyzing trace with hash -169397492, now seen corresponding path program 1 times [2022-03-15 20:24:51,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:51,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849326738] [2022-03-15 20:24:51,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:51,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:51,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:51,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849326738] [2022-03-15 20:24:51,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849326738] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:51,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:51,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:24:51,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [787182462] [2022-03-15 20:24:51,452 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:51,460 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:51,468 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 35 transitions. [2022-03-15 20:24:51,468 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:51,468 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:51,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:24:51,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:51,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:24:51,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:51,469 INFO L87 Difference]: Start difference. First operand 1454 states and 2756 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:52,557 INFO L93 Difference]: Finished difference Result 1415 states and 2680 transitions. [2022-03-15 20:24:52,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:24:52,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 35 [2022-03-15 20:24:52,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:52,563 INFO L225 Difference]: With dead ends: 1415 [2022-03-15 20:24:52,563 INFO L226 Difference]: Without dead ends: 1415 [2022-03-15 20:24:52,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:52,564 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 74 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:52,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 108 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:24:52,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2022-03-15 20:24:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1415. [2022-03-15 20:24:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1403 states have (on average 1.910192444761226) internal successors, (2680), 1414 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2680 transitions. [2022-03-15 20:24:52,620 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2680 transitions. Word has length 35 [2022-03-15 20:24:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:52,620 INFO L470 AbstractCegarLoop]: Abstraction has 1415 states and 2680 transitions. [2022-03-15 20:24:52,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2680 transitions. [2022-03-15 20:24:52,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 20:24:52,623 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:52,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:52,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 20:24:52,624 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:24:52,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1015685213, now seen corresponding path program 1 times [2022-03-15 20:24:52,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:52,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617575860] [2022-03-15 20:24:52,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:52,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:52,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:52,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617575860] [2022-03-15 20:24:52,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617575860] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:52,789 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:52,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:24:52,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1795821350] [2022-03-15 20:24:52,789 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:52,796 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:52,808 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 41 transitions. [2022-03-15 20:24:52,808 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:52,809 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:52,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:24:52,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:52,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:24:52,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:52,810 INFO L87 Difference]: Start difference. First operand 1415 states and 2680 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:54,033 INFO L93 Difference]: Finished difference Result 1534 states and 2902 transitions. [2022-03-15 20:24:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:24:54,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-03-15 20:24:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:54,038 INFO L225 Difference]: With dead ends: 1534 [2022-03-15 20:24:54,039 INFO L226 Difference]: Without dead ends: 1456 [2022-03-15 20:24:54,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:54,039 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 80 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:54,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 133 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 20:24:54,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2022-03-15 20:24:54,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1456. [2022-03-15 20:24:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1444 states have (on average 1.8905817174515236) internal successors, (2730), 1455 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 2730 transitions. [2022-03-15 20:24:54,069 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 2730 transitions. Word has length 41 [2022-03-15 20:24:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:54,071 INFO L470 AbstractCegarLoop]: Abstraction has 1456 states and 2730 transitions. [2022-03-15 20:24:54,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2730 transitions. [2022-03-15 20:24:54,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:24:54,074 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:54,074 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:54,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 20:24:54,074 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:24:54,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1172448667, now seen corresponding path program 1 times [2022-03-15 20:24:54,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:54,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110048103] [2022-03-15 20:24:54,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:54,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:54,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:54,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110048103] [2022-03-15 20:24:54,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110048103] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:54,543 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:54,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:24:54,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1208776523] [2022-03-15 20:24:54,543 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:54,550 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:54,574 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 74 transitions. [2022-03-15 20:24:54,574 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:54,979 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:54,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:24:54,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:54,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:24:54,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:24:54,980 INFO L87 Difference]: Start difference. First operand 1456 states and 2730 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:56,599 INFO L93 Difference]: Finished difference Result 1820 states and 3396 transitions. [2022-03-15 20:24:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:24:56,599 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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 42 [2022-03-15 20:24:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:56,604 INFO L225 Difference]: With dead ends: 1820 [2022-03-15 20:24:56,604 INFO L226 Difference]: Without dead ends: 1820 [2022-03-15 20:24:56,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-03-15 20:24:56,605 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 122 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:56,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 138 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 20:24:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2022-03-15 20:24:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1471. [2022-03-15 20:24:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1459 states have (on average 1.8917066483893077) internal successors, (2760), 1470 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2760 transitions. [2022-03-15 20:24:56,633 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2760 transitions. Word has length 42 [2022-03-15 20:24:56,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:56,634 INFO L470 AbstractCegarLoop]: Abstraction has 1471 states and 2760 transitions. [2022-03-15 20:24:56,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2760 transitions. [2022-03-15 20:24:56,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:24:56,635 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:56,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:56,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 20:24:56,635 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:24:56,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:56,636 INFO L85 PathProgramCache]: Analyzing trace with hash -539003899, now seen corresponding path program 2 times [2022-03-15 20:24:56,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:56,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524765638] [2022-03-15 20:24:56,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:56,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:24:57,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:57,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524765638] [2022-03-15 20:24:57,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524765638] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:57,067 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:57,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:24:57,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1055094998] [2022-03-15 20:24:57,067 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:57,074 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:57,092 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 70 transitions. [2022-03-15 20:24:57,093 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:57,367 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:57,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:24:57,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:57,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:24:57,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:24:57,369 INFO L87 Difference]: Start difference. First operand 1471 states and 2760 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:59,911 INFO L93 Difference]: Finished difference Result 1873 states and 3502 transitions. [2022-03-15 20:24:59,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:24:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:24:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:59,916 INFO L225 Difference]: With dead ends: 1873 [2022-03-15 20:24:59,916 INFO L226 Difference]: Without dead ends: 1873 [2022-03-15 20:24:59,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:24:59,917 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 122 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:59,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 171 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 20:24:59,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2022-03-15 20:24:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1489. [2022-03-15 20:24:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1477 states have (on average 1.893026404874746) internal successors, (2796), 1488 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 2796 transitions. [2022-03-15 20:24:59,944 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 2796 transitions. Word has length 42 [2022-03-15 20:24:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:59,944 INFO L470 AbstractCegarLoop]: Abstraction has 1489 states and 2796 transitions. [2022-03-15 20:24:59,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2796 transitions. [2022-03-15 20:24:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:24:59,945 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:59,945 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:59,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 20:24:59,946 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:24:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash 851259995, now seen corresponding path program 3 times [2022-03-15 20:24:59,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:59,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110814806] [2022-03-15 20:24:59,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:59,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:00,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:00,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110814806] [2022-03-15 20:25:00,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110814806] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:00,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:00,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:00,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1893537619] [2022-03-15 20:25:00,347 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:00,355 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:00,373 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 66 transitions. [2022-03-15 20:25:00,373 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:00,539 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:00,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:25:00,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:00,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:25:00,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:25:00,540 INFO L87 Difference]: Start difference. First operand 1489 states and 2796 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:03,223 INFO L93 Difference]: Finished difference Result 1904 states and 3564 transitions. [2022-03-15 20:25:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:25:03,223 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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 42 [2022-03-15 20:25:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:03,228 INFO L225 Difference]: With dead ends: 1904 [2022-03-15 20:25:03,228 INFO L226 Difference]: Without dead ends: 1904 [2022-03-15 20:25:03,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:25:03,229 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 116 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:03,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 146 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 20:25:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2022-03-15 20:25:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1508. [2022-03-15 20:25:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1496 states have (on average 1.8950534759358288) internal successors, (2835), 1507 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:03,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2835 transitions. [2022-03-15 20:25:03,256 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2835 transitions. Word has length 42 [2022-03-15 20:25:03,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:03,256 INFO L470 AbstractCegarLoop]: Abstraction has 1508 states and 2835 transitions. [2022-03-15 20:25:03,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2835 transitions. [2022-03-15 20:25:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:25:03,257 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:03,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:03,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 20:25:03,258 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:03,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:03,258 INFO L85 PathProgramCache]: Analyzing trace with hash 664645411, now seen corresponding path program 4 times [2022-03-15 20:25:03,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:03,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425745442] [2022-03-15 20:25:03,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:03,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:03,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:03,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425745442] [2022-03-15 20:25:03,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425745442] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:03,573 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:03,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:03,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1274016823] [2022-03-15 20:25:03,573 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:03,580 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:03,598 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 62 transitions. [2022-03-15 20:25:03,598 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:03,703 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:03,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:25:03,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:03,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:25:03,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:25:03,704 INFO L87 Difference]: Start difference. First operand 1508 states and 2835 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:05,303 INFO L93 Difference]: Finished difference Result 1944 states and 3644 transitions. [2022-03-15 20:25:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 20:25:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 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 42 [2022-03-15 20:25:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:05,309 INFO L225 Difference]: With dead ends: 1944 [2022-03-15 20:25:05,309 INFO L226 Difference]: Without dead ends: 1944 [2022-03-15 20:25:05,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:25:05,310 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 132 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:05,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 114 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 20:25:05,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2022-03-15 20:25:05,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1527. [2022-03-15 20:25:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1515 states have (on average 1.897029702970297) internal successors, (2874), 1526 states have internal predecessors, (2874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2874 transitions. [2022-03-15 20:25:05,337 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2874 transitions. Word has length 42 [2022-03-15 20:25:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:05,338 INFO L470 AbstractCegarLoop]: Abstraction has 1527 states and 2874 transitions. [2022-03-15 20:25:05,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2874 transitions. [2022-03-15 20:25:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:25:05,339 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:05,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:05,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 20:25:05,340 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:05,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:05,340 INFO L85 PathProgramCache]: Analyzing trace with hash 303992459, now seen corresponding path program 5 times [2022-03-15 20:25:05,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:05,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845837335] [2022-03-15 20:25:05,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:05,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:05,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:05,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845837335] [2022-03-15 20:25:05,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845837335] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:05,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:05,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:25:05,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [35196087] [2022-03-15 20:25:05,590 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:05,598 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:05,621 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 98 transitions. [2022-03-15 20:25:05,621 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:05,961 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:05,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:25:05,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:05,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:25:05,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:25:05,962 INFO L87 Difference]: Start difference. First operand 1527 states and 2874 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:07,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:07,647 INFO L93 Difference]: Finished difference Result 1585 states and 2973 transitions. [2022-03-15 20:25:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:25:07,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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 42 [2022-03-15 20:25:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:07,650 INFO L225 Difference]: With dead ends: 1585 [2022-03-15 20:25:07,650 INFO L226 Difference]: Without dead ends: 1585 [2022-03-15 20:25:07,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:25:07,651 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 96 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:07,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 128 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 20:25:07,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2022-03-15 20:25:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1431. [2022-03-15 20:25:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1420 states have (on average 1.88943661971831) internal successors, (2683), 1430 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2683 transitions. [2022-03-15 20:25:07,692 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2683 transitions. Word has length 42 [2022-03-15 20:25:07,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:07,692 INFO L470 AbstractCegarLoop]: Abstraction has 1431 states and 2683 transitions. [2022-03-15 20:25:07,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2683 transitions. [2022-03-15 20:25:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:25:07,693 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:07,693 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:07,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 20:25:07,694 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:07,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2115366812, now seen corresponding path program 1 times [2022-03-15 20:25:07,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:07,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183996179] [2022-03-15 20:25:07,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:07,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:07,899 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:07,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183996179] [2022-03-15 20:25:07,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183996179] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:07,899 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:07,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 20:25:07,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [813669663] [2022-03-15 20:25:07,899 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:07,907 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:07,937 INFO L252 McrAutomatonBuilder]: Finished intersection with 91 states and 138 transitions. [2022-03-15 20:25:07,937 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:08,339 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:08,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:25:08,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:08,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:25:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:25:08,340 INFO L87 Difference]: Start difference. First operand 1431 states and 2683 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:09,567 INFO L93 Difference]: Finished difference Result 1425 states and 2668 transitions. [2022-03-15 20:25:09,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:25:09,567 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 42 [2022-03-15 20:25:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:09,569 INFO L225 Difference]: With dead ends: 1425 [2022-03-15 20:25:09,569 INFO L226 Difference]: Without dead ends: 1425 [2022-03-15 20:25:09,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:25:09,570 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 83 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:09,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 138 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 20:25:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2022-03-15 20:25:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1401. [2022-03-15 20:25:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1390 states have (on average 1.8848920863309353) internal successors, (2620), 1400 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2620 transitions. [2022-03-15 20:25:09,605 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2620 transitions. Word has length 42 [2022-03-15 20:25:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:09,605 INFO L470 AbstractCegarLoop]: Abstraction has 1401 states and 2620 transitions. [2022-03-15 20:25:09,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2620 transitions. [2022-03-15 20:25:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-15 20:25:09,606 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:09,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:09,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-15 20:25:09,607 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1540874797, now seen corresponding path program 1 times [2022-03-15 20:25:09,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:09,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409863192] [2022-03-15 20:25:09,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:09,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:09,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:09,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409863192] [2022-03-15 20:25:09,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409863192] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:09,983 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:09,983 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:09,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1329451568] [2022-03-15 20:25:09,983 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:09,991 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:10,013 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 88 transitions. [2022-03-15 20:25:10,013 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:10,472 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [93046#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= ~A~0.base ~B~0.base)) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (not (= ~A~0.base |t_funThread1of1ForFork0_#t~mem38.base|)) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 93048#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= ~A~0.base ~B~0.base)) (not (= ~A~0.base |t_funThread1of1ForFork0_#t~mem38.base|))), 93049#(and (not (= ~A~0.base ~B~0.base)) (not (= ~A~0.base |t_funThread1of1ForFork0_#t~mem38.base|))), 93047#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= ~A~0.base ~B~0.base)) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (not (= ~A~0.base |t_funThread1of1ForFork0_#t~mem38.base|)))] [2022-03-15 20:25:10,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:25:10,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:10,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:25:10,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:25:10,473 INFO L87 Difference]: Start difference. First operand 1401 states and 2620 transitions. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:12,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:12,960 INFO L93 Difference]: Finished difference Result 1815 states and 3388 transitions. [2022-03-15 20:25:12,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 20:25:12,961 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 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 46 [2022-03-15 20:25:12,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:12,964 INFO L225 Difference]: With dead ends: 1815 [2022-03-15 20:25:12,964 INFO L226 Difference]: Without dead ends: 1813 [2022-03-15 20:25:12,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:25:12,965 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 295 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:12,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 165 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 20:25:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2022-03-15 20:25:12,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1376. [2022-03-15 20:25:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1366 states have (on average 1.882869692532943) internal successors, (2572), 1375 states have internal predecessors, (2572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2572 transitions. [2022-03-15 20:25:12,992 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2572 transitions. Word has length 46 [2022-03-15 20:25:12,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:12,992 INFO L470 AbstractCegarLoop]: Abstraction has 1376 states and 2572 transitions. [2022-03-15 20:25:12,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2572 transitions. [2022-03-15 20:25:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-15 20:25:12,993 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:12,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:12,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 20:25:12,994 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:12,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash -305557773, now seen corresponding path program 1 times [2022-03-15 20:25:12,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:12,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492775597] [2022-03-15 20:25:12,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:13,257 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:13,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492775597] [2022-03-15 20:25:13,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492775597] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:13,257 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:13,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:13,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1252592660] [2022-03-15 20:25:13,258 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:13,266 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:13,353 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 124 transitions. [2022-03-15 20:25:13,353 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:13,569 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:13,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:25:13,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:13,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:25:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:25:13,570 INFO L87 Difference]: Start difference. First operand 1376 states and 2572 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:14,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:14,824 INFO L93 Difference]: Finished difference Result 1370 states and 2557 transitions. [2022-03-15 20:25:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:25:14,825 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-03-15 20:25:14,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:14,827 INFO L225 Difference]: With dead ends: 1370 [2022-03-15 20:25:14,827 INFO L226 Difference]: Without dead ends: 1370 [2022-03-15 20:25:14,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:25:14,828 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 308 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:14,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 199 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 20:25:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2022-03-15 20:25:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1346. [2022-03-15 20:25:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1336 states have (on average 1.8802395209580838) internal successors, (2512), 1345 states have internal predecessors, (2512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 2512 transitions. [2022-03-15 20:25:14,846 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 2512 transitions. Word has length 46 [2022-03-15 20:25:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:14,847 INFO L470 AbstractCegarLoop]: Abstraction has 1346 states and 2512 transitions. [2022-03-15 20:25:14,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 2512 transitions. [2022-03-15 20:25:14,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-15 20:25:14,848 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:14,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:14,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-15 20:25:14,849 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:14,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:14,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1563866961, now seen corresponding path program 1 times [2022-03-15 20:25:14,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:14,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313785881] [2022-03-15 20:25:14,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:14,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:15,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:15,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313785881] [2022-03-15 20:25:15,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313785881] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:15,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:15,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:25:15,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [250471889] [2022-03-15 20:25:15,189 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:15,198 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:15,271 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 74 transitions. [2022-03-15 20:25:15,271 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:15,496 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:15,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:25:15,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:15,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:25:15,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:25:15,497 INFO L87 Difference]: Start difference. First operand 1346 states and 2512 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:16,393 INFO L93 Difference]: Finished difference Result 1735 states and 3228 transitions. [2022-03-15 20:25:16,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:25:16,393 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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 46 [2022-03-15 20:25:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:16,396 INFO L225 Difference]: With dead ends: 1735 [2022-03-15 20:25:16,397 INFO L226 Difference]: Without dead ends: 1735 [2022-03-15 20:25:16,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:25:16,397 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 118 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:16,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 98 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:25:16,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-03-15 20:25:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1360. [2022-03-15 20:25:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1350 states have (on average 1.8814814814814815) internal successors, (2540), 1359 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2540 transitions. [2022-03-15 20:25:16,419 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2540 transitions. Word has length 46 [2022-03-15 20:25:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:16,419 INFO L470 AbstractCegarLoop]: Abstraction has 1360 states and 2540 transitions. [2022-03-15 20:25:16,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2540 transitions. [2022-03-15 20:25:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-15 20:25:16,421 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:16,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:16,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-15 20:25:16,421 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:16,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1558180223, now seen corresponding path program 2 times [2022-03-15 20:25:16,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:16,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137765726] [2022-03-15 20:25:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:16,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:16,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137765726] [2022-03-15 20:25:16,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137765726] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:16,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:16,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:25:16,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [150326819] [2022-03-15 20:25:16,792 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:16,805 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:16,832 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 70 transitions. [2022-03-15 20:25:16,832 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:16,991 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:16,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:25:16,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:25:16,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:25:16,992 INFO L87 Difference]: Start difference. First operand 1360 states and 2540 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:18,731 INFO L93 Difference]: Finished difference Result 1772 states and 3302 transitions. [2022-03-15 20:25:18,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:25:18,731 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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 46 [2022-03-15 20:25:18,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:18,734 INFO L225 Difference]: With dead ends: 1772 [2022-03-15 20:25:18,734 INFO L226 Difference]: Without dead ends: 1772 [2022-03-15 20:25:18,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:25:18,735 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 93 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:18,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 127 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 20:25:18,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2022-03-15 20:25:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1375. [2022-03-15 20:25:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1365 states have (on average 1.8827838827838828) internal successors, (2570), 1374 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2570 transitions. [2022-03-15 20:25:18,758 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2570 transitions. Word has length 46 [2022-03-15 20:25:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:18,758 INFO L470 AbstractCegarLoop]: Abstraction has 1375 states and 2570 transitions. [2022-03-15 20:25:18,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2570 transitions. [2022-03-15 20:25:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-15 20:25:18,760 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:18,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:18,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-15 20:25:18,760 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:18,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:18,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1465793043, now seen corresponding path program 3 times [2022-03-15 20:25:18,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:18,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775551804] [2022-03-15 20:25:18,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:18,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:19,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:19,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775551804] [2022-03-15 20:25:19,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775551804] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:19,060 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:19,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:25:19,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1977054193] [2022-03-15 20:25:19,060 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:19,069 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:19,091 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 70 transitions. [2022-03-15 20:25:19,091 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:19,236 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:19,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:25:19,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:19,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:25:19,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:25:19,237 INFO L87 Difference]: Start difference. First operand 1375 states and 2570 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:20,771 INFO L93 Difference]: Finished difference Result 1767 states and 3292 transitions. [2022-03-15 20:25:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 20:25:20,772 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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 46 [2022-03-15 20:25:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:20,774 INFO L225 Difference]: With dead ends: 1767 [2022-03-15 20:25:20,774 INFO L226 Difference]: Without dead ends: 1767 [2022-03-15 20:25:20,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:25:20,775 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 124 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:20,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 126 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 20:25:20,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2022-03-15 20:25:20,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1374. [2022-03-15 20:25:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1364 states have (on average 1.8826979472140764) internal successors, (2568), 1373 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2568 transitions. [2022-03-15 20:25:20,796 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2568 transitions. Word has length 46 [2022-03-15 20:25:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:20,796 INFO L470 AbstractCegarLoop]: Abstraction has 1374 states and 2568 transitions. [2022-03-15 20:25:20,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2568 transitions. [2022-03-15 20:25:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-15 20:25:20,798 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:20,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:20,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-15 20:25:20,798 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:20,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash 899396501, now seen corresponding path program 4 times [2022-03-15 20:25:20,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:20,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875673846] [2022-03-15 20:25:20,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:21,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:21,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875673846] [2022-03-15 20:25:21,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875673846] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:21,103 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:21,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:25:21,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1691046308] [2022-03-15 20:25:21,104 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:21,112 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:21,134 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 66 transitions. [2022-03-15 20:25:21,135 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:21,244 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:21,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:25:21,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:21,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:25:21,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:25:21,245 INFO L87 Difference]: Start difference. First operand 1374 states and 2568 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:22,959 INFO L93 Difference]: Finished difference Result 1808 states and 3374 transitions. [2022-03-15 20:25:22,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:25:22,959 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-03-15 20:25:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:22,961 INFO L225 Difference]: With dead ends: 1808 [2022-03-15 20:25:22,961 INFO L226 Difference]: Without dead ends: 1808 [2022-03-15 20:25:22,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:25:22,962 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 113 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:22,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 120 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 20:25:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-03-15 20:25:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1404. [2022-03-15 20:25:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1394 states have (on average 1.885222381635581) internal successors, (2628), 1403 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2628 transitions. [2022-03-15 20:25:22,995 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2628 transitions. Word has length 46 [2022-03-15 20:25:22,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:22,995 INFO L470 AbstractCegarLoop]: Abstraction has 1404 states and 2628 transitions. [2022-03-15 20:25:22,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2628 transitions. [2022-03-15 20:25:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-15 20:25:23,001 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:23,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:23,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-15 20:25:23,001 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:23,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1064264571, now seen corresponding path program 5 times [2022-03-15 20:25:23,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:23,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679152382] [2022-03-15 20:25:23,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:23,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:23,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679152382] [2022-03-15 20:25:23,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679152382] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:23,311 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:23,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:25:23,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1160827182] [2022-03-15 20:25:23,312 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:23,321 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:23,341 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 66 transitions. [2022-03-15 20:25:23,342 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:23,444 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:23,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:23,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:23,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:23,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:23,445 INFO L87 Difference]: Start difference. First operand 1404 states and 2628 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:25,617 INFO L93 Difference]: Finished difference Result 1803 states and 3364 transitions. [2022-03-15 20:25:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 20:25:25,617 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-03-15 20:25:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:25,620 INFO L225 Difference]: With dead ends: 1803 [2022-03-15 20:25:25,620 INFO L226 Difference]: Without dead ends: 1803 [2022-03-15 20:25:25,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:25:25,621 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 239 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:25,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 133 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:25:25,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2022-03-15 20:25:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1389. [2022-03-15 20:25:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1379 states have (on average 1.8839738941261783) internal successors, (2598), 1388 states have internal predecessors, (2598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2598 transitions. [2022-03-15 20:25:25,637 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2598 transitions. Word has length 46 [2022-03-15 20:25:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:25,637 INFO L470 AbstractCegarLoop]: Abstraction has 1389 states and 2598 transitions. [2022-03-15 20:25:25,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2598 transitions. [2022-03-15 20:25:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-15 20:25:25,639 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:25,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:25,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 20:25:25,639 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:25,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:25,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2145776751, now seen corresponding path program 6 times [2022-03-15 20:25:25,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:25,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497062195] [2022-03-15 20:25:25,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:25,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:25,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:25,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497062195] [2022-03-15 20:25:25,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497062195] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:25,950 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:25,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:25:25,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [333019587] [2022-03-15 20:25:25,950 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:25,957 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:25,977 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 66 transitions. [2022-03-15 20:25:25,977 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:26,076 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:26,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:26,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:26,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:26,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:26,078 INFO L87 Difference]: Start difference. First operand 1389 states and 2598 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:28,399 INFO L93 Difference]: Finished difference Result 1773 states and 3306 transitions. [2022-03-15 20:25:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:25:28,399 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-03-15 20:25:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:28,401 INFO L225 Difference]: With dead ends: 1773 [2022-03-15 20:25:28,401 INFO L226 Difference]: Without dead ends: 1773 [2022-03-15 20:25:28,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=543, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:25:28,402 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 245 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:28,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 271 Invalid, 2096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 20:25:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2022-03-15 20:25:28,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1388. [2022-03-15 20:25:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1378 states have (on average 1.88388969521045) internal successors, (2596), 1387 states have internal predecessors, (2596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2596 transitions. [2022-03-15 20:25:28,418 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2596 transitions. Word has length 46 [2022-03-15 20:25:28,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:28,419 INFO L470 AbstractCegarLoop]: Abstraction has 1388 states and 2596 transitions. [2022-03-15 20:25:28,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2596 transitions. [2022-03-15 20:25:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-15 20:25:28,420 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:28,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:28,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 20:25:28,420 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:28,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:28,421 INFO L85 PathProgramCache]: Analyzing trace with hash 743350013, now seen corresponding path program 7 times [2022-03-15 20:25:28,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:28,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355944503] [2022-03-15 20:25:28,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:28,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:28,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:28,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355944503] [2022-03-15 20:25:28,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355944503] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:28,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:28,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 20:25:28,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [794124576] [2022-03-15 20:25:28,676 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:28,684 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:28,714 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 102 transitions. [2022-03-15 20:25:28,714 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:28,900 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:28,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:25:28,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:28,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:25:28,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:25:28,901 INFO L87 Difference]: Start difference. First operand 1388 states and 2596 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:30,650 INFO L93 Difference]: Finished difference Result 1485 states and 2775 transitions. [2022-03-15 20:25:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 20:25:30,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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 46 [2022-03-15 20:25:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:30,654 INFO L225 Difference]: With dead ends: 1485 [2022-03-15 20:25:30,654 INFO L226 Difference]: Without dead ends: 1485 [2022-03-15 20:25:30,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:25:30,655 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 83 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:30,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 128 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 20:25:30,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2022-03-15 20:25:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1373. [2022-03-15 20:25:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1363 states have (on average 1.8826118855465883) internal successors, (2566), 1372 states have internal predecessors, (2566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2566 transitions. [2022-03-15 20:25:30,669 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2566 transitions. Word has length 46 [2022-03-15 20:25:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:30,669 INFO L470 AbstractCegarLoop]: Abstraction has 1373 states and 2566 transitions. [2022-03-15 20:25:30,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2566 transitions. [2022-03-15 20:25:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-15 20:25:30,671 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:30,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:30,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-15 20:25:30,671 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:30,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1220311059, now seen corresponding path program 8 times [2022-03-15 20:25:30,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:30,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250483081] [2022-03-15 20:25:30,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:30,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:30,931 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:30,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250483081] [2022-03-15 20:25:30,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250483081] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:30,931 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:30,931 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:30,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1293133920] [2022-03-15 20:25:30,931 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:30,940 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:30,990 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 102 transitions. [2022-03-15 20:25:30,990 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:31,280 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:31,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:25:31,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:31,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:25:31,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:25:31,281 INFO L87 Difference]: Start difference. First operand 1373 states and 2566 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:32,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:32,896 INFO L93 Difference]: Finished difference Result 1499 states and 2803 transitions. [2022-03-15 20:25:32,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:25:32,896 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 46 [2022-03-15 20:25:32,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:32,898 INFO L225 Difference]: With dead ends: 1499 [2022-03-15 20:25:32,898 INFO L226 Difference]: Without dead ends: 1499 [2022-03-15 20:25:32,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:25:32,899 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 212 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:32,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 137 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 20:25:32,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2022-03-15 20:25:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1358. [2022-03-15 20:25:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1348 states have (on average 1.8813056379821957) internal successors, (2536), 1357 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2536 transitions. [2022-03-15 20:25:32,916 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2536 transitions. Word has length 46 [2022-03-15 20:25:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:32,916 INFO L470 AbstractCegarLoop]: Abstraction has 1358 states and 2536 transitions. [2022-03-15 20:25:32,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2536 transitions. [2022-03-15 20:25:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-15 20:25:32,918 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:32,918 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:32,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-15 20:25:32,918 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:32,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:32,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1993144057, now seen corresponding path program 9 times [2022-03-15 20:25:32,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:32,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269358582] [2022-03-15 20:25:32,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:32,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:33,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:33,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269358582] [2022-03-15 20:25:33,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269358582] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:33,209 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:33,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:33,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [606444538] [2022-03-15 20:25:33,209 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:33,216 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:33,284 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 102 transitions. [2022-03-15 20:25:33,284 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:33,498 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:33,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:25:33,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:33,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:25:33,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:25:33,499 INFO L87 Difference]: Start difference. First operand 1358 states and 2536 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:35,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:35,509 INFO L93 Difference]: Finished difference Result 1388 states and 2589 transitions. [2022-03-15 20:25:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:25:35,509 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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 46 [2022-03-15 20:25:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:35,511 INFO L225 Difference]: With dead ends: 1388 [2022-03-15 20:25:35,511 INFO L226 Difference]: Without dead ends: 1388 [2022-03-15 20:25:35,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:25:35,512 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 213 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:35,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 273 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1574 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 20:25:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2022-03-15 20:25:35,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1301. [2022-03-15 20:25:35,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1301 states, 1291 states have (on average 1.882261812548412) internal successors, (2430), 1300 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 2430 transitions. [2022-03-15 20:25:35,525 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 2430 transitions. Word has length 46 [2022-03-15 20:25:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:35,525 INFO L470 AbstractCegarLoop]: Abstraction has 1301 states and 2430 transitions. [2022-03-15 20:25:35,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 2430 transitions. [2022-03-15 20:25:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-15 20:25:35,527 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:35,527 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:35,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-15 20:25:35,527 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 20:25:35,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:35,528 INFO L85 PathProgramCache]: Analyzing trace with hash -629279133, now seen corresponding path program 1 times [2022-03-15 20:25:35,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:35,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117927961] [2022-03-15 20:25:35,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:35,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:25:35,640 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:25:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:25:35,719 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:25:35,719 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:25:35,720 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (36 of 37 remaining) [2022-03-15 20:25:35,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2022-03-15 20:25:35,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2022-03-15 20:25:35,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2022-03-15 20:25:35,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2022-03-15 20:25:35,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2022-03-15 20:25:35,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2022-03-15 20:25:35,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2022-03-15 20:25:35,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2022-03-15 20:25:35,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2022-03-15 20:25:35,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2022-03-15 20:25:35,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2022-03-15 20:25:35,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2022-03-15 20:25:35,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2022-03-15 20:25:35,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2022-03-15 20:25:35,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2022-03-15 20:25:35,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2022-03-15 20:25:35,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2022-03-15 20:25:35,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2022-03-15 20:25:35,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2022-03-15 20:25:35,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (16 of 37 remaining) [2022-03-15 20:25:35,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2022-03-15 20:25:35,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2022-03-15 20:25:35,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2022-03-15 20:25:35,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2022-03-15 20:25:35,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2022-03-15 20:25:35,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2022-03-15 20:25:35,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2022-03-15 20:25:35,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2022-03-15 20:25:35,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2022-03-15 20:25:35,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2022-03-15 20:25:35,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2022-03-15 20:25:35,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2022-03-15 20:25:35,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2022-03-15 20:25:35,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2022-03-15 20:25:35,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2022-03-15 20:25:35,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2022-03-15 20:25:35,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-15 20:25:35,727 INFO L732 BasicCegarLoop]: Path program histogram: [9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:35,731 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:25:35,732 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:25:35,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:25:35 BasicIcfg [2022-03-15 20:25:35,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:25:35,780 INFO L158 Benchmark]: Toolchain (without parser) took 712218.30ms. Allocated memory was 181.4MB in the beginning and 541.1MB in the end (delta: 359.7MB). Free memory was 130.8MB in the beginning and 169.9MB in the end (delta: -39.2MB). Peak memory consumption was 321.7MB. Max. memory is 8.0GB. [2022-03-15 20:25:35,780 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:25:35,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 835.61ms. Allocated memory is still 181.4MB. Free memory was 130.6MB in the beginning and 129.6MB in the end (delta: 951.2kB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. [2022-03-15 20:25:35,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.91ms. Allocated memory is still 181.4MB. Free memory was 129.6MB in the beginning and 125.9MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 20:25:35,780 INFO L158 Benchmark]: Boogie Preprocessor took 38.46ms. Allocated memory is still 181.4MB. Free memory was 125.9MB in the beginning and 122.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 20:25:35,781 INFO L158 Benchmark]: RCFGBuilder took 720.41ms. Allocated memory was 181.4MB in the beginning and 226.5MB in the end (delta: 45.1MB). Free memory was 122.8MB in the beginning and 193.2MB in the end (delta: -70.3MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. [2022-03-15 20:25:35,781 INFO L158 Benchmark]: TraceAbstraction took 710549.61ms. Allocated memory was 226.5MB in the beginning and 541.1MB in the end (delta: 314.6MB). Free memory was 192.6MB in the beginning and 169.9MB in the end (delta: 22.7MB). Peak memory consumption was 337.3MB. Max. memory is 8.0GB. [2022-03-15 20:25:35,782 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 835.61ms. Allocated memory is still 181.4MB. Free memory was 130.6MB in the beginning and 129.6MB in the end (delta: 951.2kB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.91ms. Allocated memory is still 181.4MB. Free memory was 129.6MB in the beginning and 125.9MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.46ms. Allocated memory is still 181.4MB. Free memory was 125.9MB in the beginning and 122.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 720.41ms. Allocated memory was 181.4MB in the beginning and 226.5MB in the end (delta: 45.1MB). Free memory was 122.8MB in the beginning and 193.2MB in the end (delta: -70.3MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. * TraceAbstraction took 710549.61ms. Allocated memory was 226.5MB in the beginning and 541.1MB in the end (delta: 314.6MB). Free memory was 192.6MB in the beginning and 169.9MB in the end (delta: 22.7MB). Peak memory consumption was 337.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 657.3s, 290 PlacesBefore, 107 PlacesAfterwards, 286 TransitionsBefore, 103 TransitionsAfterwards, 7728 CoEnabledTransitionPairs, 11 FixpointIterations, 241 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 280 TotalNumberOfCompositions, 88625 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12856, positive: 10900, positive conditional: 0, positive unconditional: 10900, negative: 1956, negative conditional: 0, negative unconditional: 1956, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2788, positive: 2619, positive conditional: 0, positive unconditional: 2619, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12856, positive: 8281, positive conditional: 0, positive unconditional: 8281, negative: 1787, negative conditional: 0, negative unconditional: 1787, unknown: 2788, unknown conditional: 0, unknown unconditional: 2788] , Statistics on independence cache: Total cache size (in pairs): 532, Positive cache size: 433, Positive conditional cache size: 0, Positive unconditional cache size: 433, Negative cache size: 99, Negative conditional cache size: 0, Negative unconditional cache size: 99 - 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: 1259]: Data race detected Data race detected The following path leads to a data race: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_t t1; [L1244] 0 struct s *p = malloc(sizeof(struct s)); [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) [L1247] 0 init(A,3) [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(A,3) [L1248] EXPR 0 A->next [L1248] 0 A->next = p [L1249] 0 B = malloc(sizeof(struct s)) [L1250] 0 init(B,5) [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1250] RET 0 init(B,5) [L1251] EXPR 0 B->next [L1251] 0 B->next = p [L1252] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-2:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-3:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={13:0}] [L1254] EXPR 0 A->next VAL [A={-2:0}, A->next={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-3:0}, t1={13:0}] [L1254] 0 p = A->next VAL [A={-2:0}, A->next={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-3:0}, t1={13:0}] [L1255] EXPR 0 p->datum VAL [A={-2:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-3:0}, p->datum=9, t1={13:0}] [L1255] 0 printf("%d\n", p->datum) VAL [A={-2:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-3:0}, p->datum=9, t1={13:0}] [L1235] EXPR 1 A->next VAL [A={-2:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1258] EXPR 0 B->next VAL [A={-2:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B->next={-3:0}, B_mutex={4:0}, p={-3:0}, t1={13:0}] [L1258] 0 p = B->next VAL [A={-2:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B->next={-3:0}, B_mutex={4:0}, p={-3:0}, t1={13:0}] [L1259] EXPR 0 p->datum VAL [A={-2:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-3:0}, p->datum=9, t1={13:0}] [L1235] EXPR 1 A->next [L1235] EXPR 1 A->next->datum [L1235] 1 A->next->datum++ VAL [A={-2:0}, A->next={-3:0}, A->next->datum=9, A->next->datum++=111, A->next->datum++=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1259] 0 printf("%d\n", p->datum) VAL [A={-2:0}, A->next={-3:0}, A->next->datum=9, A->next->datum++=111, A->next->datum++=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-3:0}, p->datum=9, t1={13:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: B->next = p [1251] * C: A->next = p [1248] * C: A->next = p [1248] * C: p -> next = ((void *)0) [1229] * C: B = malloc(sizeof(struct s)) [1249] * C: A->next = p [1248] * C: B->next = p [1251] * C: p -> datum = x [1228] * C: p -> datum = x [1228] * C: p -> datum = x [1228] * C: A->next->datum++ [1235] * C: p -> next = ((void *)0) [1229] * C: B->next = p [1251] * C: A->next = p [1248] * C: p -> datum = x [1228] * C: p -> next = ((void *)0) [1229] * C: A = malloc(sizeof(struct s)) [1246] * C: p -> next = ((void *)0) [1229] * C: B->next = p [1251] and C: printf("%d\n", p->datum) [1259] - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1249]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1255]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1258]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1258]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1252]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 358 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 710.3s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 39.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 657.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3640 SdHoareTripleChecker+Valid, 36.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3640 mSDsluCounter, 3708 SdHoareTripleChecker+Invalid, 33.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5150 mSDsCounter, 3820 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21257 IncrementalHoareTripleChecker+Invalid, 25077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3820 mSolverCounterUnsat, 1393 mSDtfsCounter, 21257 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 839 GetRequests, 465 SyntacticMatches, 31 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2185occurred in iteration=6, InterpolantAutomatonStates: 336, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 6371 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1025 NumberOfCodeBlocks, 1025 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 949 ConstructedInterpolants, 0 QuantifiedInterpolants, 15899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-03-15 20:25:35,873 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...