/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-bc289cb [2022-01-28 14:16:05,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-28 14:16:05,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-28 14:16:06,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-28 14:16:06,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-28 14:16:06,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-28 14:16:06,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-28 14:16:06,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-28 14:16:06,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-28 14:16:06,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-28 14:16:06,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-28 14:16:06,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-28 14:16:06,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-28 14:16:06,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-28 14:16:06,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-28 14:16:06,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-28 14:16:06,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-28 14:16:06,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-28 14:16:06,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-28 14:16:06,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-28 14:16:06,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-28 14:16:06,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-28 14:16:06,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-28 14:16:06,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-28 14:16:06,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-28 14:16:06,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-28 14:16:06,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-28 14:16:06,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-28 14:16:06,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-28 14:16:06,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-28 14:16:06,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-28 14:16:06,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-28 14:16:06,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-28 14:16:06,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-28 14:16:06,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-28 14:16:06,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-28 14:16:06,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-28 14:16:06,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-28 14:16:06,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-28 14:16:06,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-28 14:16:06,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-28 14:16:06,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-28 14:16:06,104 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-28 14:16:06,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-28 14:16:06,105 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-28 14:16:06,105 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-28 14:16:06,106 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-28 14:16:06,106 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-28 14:16:06,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-28 14:16:06,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-28 14:16:06,106 INFO L138 SettingsManager]: * Use SBE=true [2022-01-28 14:16:06,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-28 14:16:06,107 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-28 14:16:06,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-28 14:16:06,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-28 14:16:06,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-28 14:16:06,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-28 14:16:06,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-28 14:16:06,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-28 14:16:06,107 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-28 14:16:06,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-28 14:16:06,108 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-28 14:16:06,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-28 14:16:06,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-28 14:16:06,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-28 14:16:06,108 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-28 14:16:06,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-28 14:16:06,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 14:16:06,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-28 14:16:06,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-28 14:16:06,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-28 14:16:06,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-28 14:16:06,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-28 14:16:06,109 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-28 14:16:06,109 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-28 14:16:06,109 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-01-28 14:16:06,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-28 14:16:06,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-28 14:16:06,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-28 14:16:06,342 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-28 14:16:06,343 INFO L275 PluginConnector]: CDTParser initialized [2022-01-28 14:16:06,344 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-01-28 14:16:06,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a97621070/fe602fd8d0e24d7f8fa15abd4af494a8/FLAGaba028785 [2022-01-28 14:16:06,847 INFO L306 CDTParser]: Found 1 translation units. [2022-01-28 14:16:06,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2022-01-28 14:16:06,856 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a97621070/fe602fd8d0e24d7f8fa15abd4af494a8/FLAGaba028785 [2022-01-28 14:16:06,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a97621070/fe602fd8d0e24d7f8fa15abd4af494a8 [2022-01-28 14:16:06,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-28 14:16:06,871 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-28 14:16:06,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-28 14:16:06,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-28 14:16:06,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-28 14:16:06,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 02:16:06" (1/1) ... [2022-01-28 14:16:06,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a8cb716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:06, skipping insertion in model container [2022-01-28 14:16:06,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 02:16:06" (1/1) ... [2022-01-28 14:16:06,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-28 14:16:06,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-28 14:16:07,354 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 14:16:07,362 INFO L203 MainTranslator]: Completed pre-run [2022-01-28 14:16:07,444 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 14:16:07,492 INFO L208 MainTranslator]: Completed translation [2022-01-28 14:16:07,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:07 WrapperNode [2022-01-28 14:16:07,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-28 14:16:07,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-28 14:16:07,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-28 14:16:07,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-28 14:16:07,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:07" (1/1) ... [2022-01-28 14:16:07,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:07" (1/1) ... [2022-01-28 14:16:07,533 INFO L137 Inliner]: procedures = 368, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 184 [2022-01-28 14:16:07,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-28 14:16:07,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-28 14:16:07,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-28 14:16:07,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-28 14:16:07,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:07" (1/1) ... [2022-01-28 14:16:07,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:07" (1/1) ... [2022-01-28 14:16:07,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:07" (1/1) ... [2022-01-28 14:16:07,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:07" (1/1) ... [2022-01-28 14:16:07,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:07" (1/1) ... [2022-01-28 14:16:07,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:07" (1/1) ... [2022-01-28 14:16:07,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:07" (1/1) ... [2022-01-28 14:16:07,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-28 14:16:07,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-28 14:16:07,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-28 14:16:07,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-28 14:16:07,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:07" (1/1) ... [2022-01-28 14:16:07,596 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 14:16:07,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 14:16:07,618 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-01-28 14:16:07,635 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-01-28 14:16:07,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-28 14:16:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-28 14:16:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-28 14:16:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-28 14:16:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-28 14:16:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-28 14:16:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-28 14:16:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-28 14:16:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-28 14:16:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-01-28 14:16:07,653 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-01-28 14:16:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-28 14:16:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-28 14:16:07,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-28 14:16:07,654 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-28 14:16:07,775 INFO L234 CfgBuilder]: Building ICFG [2022-01-28 14:16:07,776 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-28 14:16:08,145 INFO L275 CfgBuilder]: Performing block encoding [2022-01-28 14:16:08,154 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-28 14:16:08,154 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-28 14:16:08,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 02:16:08 BoogieIcfgContainer [2022-01-28 14:16:08,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-28 14:16:08,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-28 14:16:08,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-28 14:16:08,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-28 14:16:08,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 02:16:06" (1/3) ... [2022-01-28 14:16:08,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48324c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 02:16:08, skipping insertion in model container [2022-01-28 14:16:08,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:07" (2/3) ... [2022-01-28 14:16:08,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48324c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 02:16:08, skipping insertion in model container [2022-01-28 14:16:08,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 02:16:08" (3/3) ... [2022-01-28 14:16:08,161 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2022-01-28 14:16:08,164 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-28 14:16:08,164 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-28 14:16:08,164 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-01-28 14:16:08,164 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-28 14:16:08,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,191 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,191 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,191 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,192 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,214 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,214 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 14:16:08,217 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-28 14:16:08,259 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-28 14:16:08,262 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-28 14:16:08,262 INFO L340 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2022-01-28 14:16:08,273 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 290 places, 286 transitions, 577 flow [2022-01-28 14:16:08,418 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4078 states, 4002 states have (on average 1.9662668665667167) internal successors, (7869), 4077 states have internal predecessors, (7869), 0 states have call successors, (0), 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-01-28 14:16:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 4078 states, 4002 states have (on average 1.9662668665667167) internal successors, (7869), 4077 states have internal predecessors, (7869), 0 states have call successors, (0), 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-01-28 14:16:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-28 14:16:08,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:08,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 14:16:08,431 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:08,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2019786680, now seen corresponding path program 1 times [2022-01-28 14:16:08,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:08,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646719978] [2022-01-28 14:16:08,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:08,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:08,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:08,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646719978] [2022-01-28 14:16:08,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646719978] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:08,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:08,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-28 14:16:08,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898209559] [2022-01-28 14:16:08,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:08,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 14:16:08,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:08,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 14:16:08,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-28 14:16:08,793 INFO L87 Difference]: Start difference. First operand has 4078 states, 4002 states have (on average 1.9662668665667167) internal successors, (7869), 4077 states have internal predecessors, (7869), 0 states have call successors, (0), 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 6 states, 5 states have (on average 10.0) internal successors, (50), 6 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-01-28 14:16:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:09,056 INFO L93 Difference]: Finished difference Result 4075 states and 7866 transitions. [2022-01-28 14:16:09,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 14:16:09,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 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 50 [2022-01-28 14:16:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:09,080 INFO L225 Difference]: With dead ends: 4075 [2022-01-28 14:16:09,080 INFO L226 Difference]: Without dead ends: 4075 [2022-01-28 14:16:09,081 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-01-28 14:16:09,083 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 6 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:09,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 585 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-28 14:16:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2022-01-28 14:16:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 4075. [2022-01-28 14:16:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4075 states, 4002 states have (on average 1.9655172413793103) internal successors, (7866), 4074 states have internal predecessors, (7866), 0 states have call successors, (0), 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-01-28 14:16:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4075 states to 4075 states and 7866 transitions. [2022-01-28 14:16:09,198 INFO L78 Accepts]: Start accepts. Automaton has 4075 states and 7866 transitions. Word has length 50 [2022-01-28 14:16:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:09,198 INFO L470 AbstractCegarLoop]: Abstraction has 4075 states and 7866 transitions. [2022-01-28 14:16:09,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 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-01-28 14:16:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 4075 states and 7866 transitions. [2022-01-28 14:16:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-28 14:16:09,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:09,200 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 14:16:09,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-28 14:16:09,200 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:09,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:09,201 INFO L85 PathProgramCache]: Analyzing trace with hash 433367205, now seen corresponding path program 1 times [2022-01-28 14:16:09,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:09,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686063394] [2022-01-28 14:16:09,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:09,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:09,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:09,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686063394] [2022-01-28 14:16:09,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686063394] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:09,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:09,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-28 14:16:09,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141273990] [2022-01-28 14:16:09,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:09,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 14:16:09,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:09,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 14:16:09,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-28 14:16:09,337 INFO L87 Difference]: Start difference. First operand 4075 states and 7866 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 14:16:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:09,596 INFO L93 Difference]: Finished difference Result 4072 states and 7863 transitions. [2022-01-28 14:16:09,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 14:16:09,597 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-01-28 14:16:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:09,608 INFO L225 Difference]: With dead ends: 4072 [2022-01-28 14:16:09,608 INFO L226 Difference]: Without dead ends: 4072 [2022-01-28 14:16:09,609 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-01-28 14:16:09,609 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 3 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:09,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 740 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-28 14:16:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4072 states. [2022-01-28 14:16:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4072 to 4072. [2022-01-28 14:16:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4072 states, 4002 states have (on average 1.964767616191904) internal successors, (7863), 4071 states have internal predecessors, (7863), 0 states have call successors, (0), 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-01-28 14:16:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4072 states to 4072 states and 7863 transitions. [2022-01-28 14:16:09,674 INFO L78 Accepts]: Start accepts. Automaton has 4072 states and 7863 transitions. Word has length 58 [2022-01-28 14:16:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:09,674 INFO L470 AbstractCegarLoop]: Abstraction has 4072 states and 7863 transitions. [2022-01-28 14:16:09,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 14:16:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 4072 states and 7863 transitions. [2022-01-28 14:16:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-28 14:16:09,675 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:09,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 14:16:09,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-28 14:16:09,676 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:09,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:09,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1886336480, now seen corresponding path program 1 times [2022-01-28 14:16:09,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:09,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127671398] [2022-01-28 14:16:09,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:09,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:09,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:09,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127671398] [2022-01-28 14:16:09,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127671398] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:09,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:09,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-28 14:16:09,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376848042] [2022-01-28 14:16:09,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:09,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-28 14:16:09,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:09,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-28 14:16:09,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 14:16:09,711 INFO L87 Difference]: Start difference. First operand 4072 states and 7863 transitions. Second operand has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 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-01-28 14:16:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:09,738 INFO L93 Difference]: Finished difference Result 4071 states and 7862 transitions. [2022-01-28 14:16:09,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-28 14:16:09,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 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 65 [2022-01-28 14:16:09,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:09,754 INFO L225 Difference]: With dead ends: 4071 [2022-01-28 14:16:09,754 INFO L226 Difference]: Without dead ends: 4071 [2022-01-28 14:16:09,756 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-01-28 14:16:09,761 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 2 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:09,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 535 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 14:16:09,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2022-01-28 14:16:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 4071. [2022-01-28 14:16:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4071 states, 4002 states have (on average 1.9645177411294352) internal successors, (7862), 4070 states have internal predecessors, (7862), 0 states have call successors, (0), 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-01-28 14:16:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4071 states to 4071 states and 7862 transitions. [2022-01-28 14:16:09,872 INFO L78 Accepts]: Start accepts. Automaton has 4071 states and 7862 transitions. Word has length 65 [2022-01-28 14:16:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:09,872 INFO L470 AbstractCegarLoop]: Abstraction has 4071 states and 7862 transitions. [2022-01-28 14:16:09,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 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-01-28 14:16:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 7862 transitions. [2022-01-28 14:16:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-28 14:16:09,874 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:09,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 14:16:09,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-28 14:16:09,874 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1758764611, now seen corresponding path program 1 times [2022-01-28 14:16:09,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:09,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190297235] [2022-01-28 14:16:09,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:09,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:09,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:09,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190297235] [2022-01-28 14:16:09,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190297235] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:09,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:09,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-28 14:16:09,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473631175] [2022-01-28 14:16:09,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:09,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-28 14:16:09,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:09,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-28 14:16:09,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 14:16:09,943 INFO L87 Difference]: Start difference. First operand 4071 states and 7862 transitions. Second operand has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-01-28 14:16:09,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:09,970 INFO L93 Difference]: Finished difference Result 3943 states and 7610 transitions. [2022-01-28 14:16:09,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-28 14:16:09,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-01-28 14:16:09,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:09,984 INFO L225 Difference]: With dead ends: 3943 [2022-01-28 14:16:09,984 INFO L226 Difference]: Without dead ends: 3943 [2022-01-28 14:16:09,984 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-01-28 14:16:09,990 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 203 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:09,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 334 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 14:16:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2022-01-28 14:16:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3943. [2022-01-28 14:16:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3943 states, 3891 states have (on average 1.9557954253405294) internal successors, (7610), 3942 states have internal predecessors, (7610), 0 states have call successors, (0), 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-01-28 14:16:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 7610 transitions. [2022-01-28 14:16:10,064 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 7610 transitions. Word has length 69 [2022-01-28 14:16:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:10,065 INFO L470 AbstractCegarLoop]: Abstraction has 3943 states and 7610 transitions. [2022-01-28 14:16:10,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-01-28 14:16:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 7610 transitions. [2022-01-28 14:16:10,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-28 14:16:10,070 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:10,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 14:16:10,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-28 14:16:10,070 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:10,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:10,071 INFO L85 PathProgramCache]: Analyzing trace with hash 894955619, now seen corresponding path program 1 times [2022-01-28 14:16:10,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:10,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011632990] [2022-01-28 14:16:10,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:10,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:10,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:10,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011632990] [2022-01-28 14:16:10,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011632990] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:10,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:10,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-28 14:16:10,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826528405] [2022-01-28 14:16:10,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:10,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 14:16:10,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:10,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 14:16:10,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-28 14:16:10,189 INFO L87 Difference]: Start difference. First operand 3943 states and 7610 transitions. Second operand has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 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-01-28 14:16:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:10,344 INFO L93 Difference]: Finished difference Result 3942 states and 7609 transitions. [2022-01-28 14:16:10,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 14:16:10,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2022-01-28 14:16:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:10,363 INFO L225 Difference]: With dead ends: 3942 [2022-01-28 14:16:10,363 INFO L226 Difference]: Without dead ends: 3942 [2022-01-28 14:16:10,363 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-01-28 14:16:10,364 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:10,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 592 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 14:16:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2022-01-28 14:16:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 3942. [2022-01-28 14:16:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3891 states have (on average 1.955538421999486) internal successors, (7609), 3941 states have internal predecessors, (7609), 0 states have call successors, (0), 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-01-28 14:16:10,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 7609 transitions. [2022-01-28 14:16:10,442 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 7609 transitions. Word has length 100 [2022-01-28 14:16:10,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:10,443 INFO L470 AbstractCegarLoop]: Abstraction has 3942 states and 7609 transitions. [2022-01-28 14:16:10,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 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-01-28 14:16:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 7609 transitions. [2022-01-28 14:16:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-28 14:16:10,448 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:10,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 14:16:10,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-28 14:16:10,448 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:10,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:10,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1539731552, now seen corresponding path program 1 times [2022-01-28 14:16:10,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:10,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676787813] [2022-01-28 14:16:10,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:10,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:10,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:10,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676787813] [2022-01-28 14:16:10,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676787813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:10,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:10,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-28 14:16:10,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430090851] [2022-01-28 14:16:10,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:10,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-28 14:16:10,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:10,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-28 14:16:10,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 14:16:10,489 INFO L87 Difference]: Start difference. First operand 3942 states and 7609 transitions. Second operand has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-01-28 14:16:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:10,510 INFO L93 Difference]: Finished difference Result 3941 states and 7608 transitions. [2022-01-28 14:16:10,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-28 14:16:10,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-01-28 14:16:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:10,521 INFO L225 Difference]: With dead ends: 3941 [2022-01-28 14:16:10,521 INFO L226 Difference]: Without dead ends: 3941 [2022-01-28 14:16:10,521 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-01-28 14:16:10,522 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 2 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:10,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 523 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 14:16:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2022-01-28 14:16:10,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3941. [2022-01-28 14:16:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3941 states, 3891 states have (on average 1.9552814186584426) internal successors, (7608), 3940 states have internal predecessors, (7608), 0 states have call successors, (0), 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-01-28 14:16:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 7608 transitions. [2022-01-28 14:16:10,572 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 7608 transitions. Word has length 106 [2022-01-28 14:16:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:10,572 INFO L470 AbstractCegarLoop]: Abstraction has 3941 states and 7608 transitions. [2022-01-28 14:16:10,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-01-28 14:16:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 7608 transitions. [2022-01-28 14:16:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-28 14:16:10,573 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:10,573 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 14:16:10,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-28 14:16:10,573 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:10,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:10,573 INFO L85 PathProgramCache]: Analyzing trace with hash -930597695, now seen corresponding path program 1 times [2022-01-28 14:16:10,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:10,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634923710] [2022-01-28 14:16:10,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:10,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:10,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:10,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634923710] [2022-01-28 14:16:10,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634923710] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:10,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:10,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-28 14:16:10,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521217306] [2022-01-28 14:16:10,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:10,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-28 14:16:10,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:10,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-28 14:16:10,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 14:16:10,611 INFO L87 Difference]: Start difference. First operand 3941 states and 7608 transitions. Second operand has 3 states, 2 states have (on average 55.0) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-01-28 14:16:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:10,629 INFO L93 Difference]: Finished difference Result 3815 states and 7360 transitions. [2022-01-28 14:16:10,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-28 14:16:10,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 55.0) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-01-28 14:16:10,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:10,635 INFO L225 Difference]: With dead ends: 3815 [2022-01-28 14:16:10,635 INFO L226 Difference]: Without dead ends: 3815 [2022-01-28 14:16:10,635 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-01-28 14:16:10,636 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 156 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:10,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 369 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 14:16:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2022-01-28 14:16:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 3815. [2022-01-28 14:16:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3815 states, 3780 states have (on average 1.947089947089947) internal successors, (7360), 3814 states have internal predecessors, (7360), 0 states have call successors, (0), 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-01-28 14:16:10,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 7360 transitions. [2022-01-28 14:16:10,683 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 7360 transitions. Word has length 110 [2022-01-28 14:16:10,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:10,683 INFO L470 AbstractCegarLoop]: Abstraction has 3815 states and 7360 transitions. [2022-01-28 14:16:10,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 55.0) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-01-28 14:16:10,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 7360 transitions. [2022-01-28 14:16:10,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-01-28 14:16:10,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:10,684 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:10,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-28 14:16:10,685 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:10,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:10,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1661222507, now seen corresponding path program 1 times [2022-01-28 14:16:10,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:10,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820680182] [2022-01-28 14:16:10,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:10,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:10,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:10,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820680182] [2022-01-28 14:16:10,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820680182] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:10,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:10,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-28 14:16:10,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347508872] [2022-01-28 14:16:10,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:10,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 14:16:10,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:10,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 14:16:10,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-28 14:16:10,797 INFO L87 Difference]: Start difference. First operand 3815 states and 7360 transitions. Second operand has 6 states, 5 states have (on average 28.2) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-01-28 14:16:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:10,885 INFO L93 Difference]: Finished difference Result 3814 states and 7359 transitions. [2022-01-28 14:16:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 14:16:10,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 28.2) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2022-01-28 14:16:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:10,891 INFO L225 Difference]: With dead ends: 3814 [2022-01-28 14:16:10,891 INFO L226 Difference]: Without dead ends: 3814 [2022-01-28 14:16:10,891 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-01-28 14:16:10,892 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 3 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:10,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 419 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 14:16:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3814 states. [2022-01-28 14:16:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 3814. [2022-01-28 14:16:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3814 states, 3780 states have (on average 1.9468253968253968) internal successors, (7359), 3813 states have internal predecessors, (7359), 0 states have call successors, (0), 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-01-28 14:16:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3814 states and 7359 transitions. [2022-01-28 14:16:10,967 INFO L78 Accepts]: Start accepts. Automaton has 3814 states and 7359 transitions. Word has length 141 [2022-01-28 14:16:10,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:10,968 INFO L470 AbstractCegarLoop]: Abstraction has 3814 states and 7359 transitions. [2022-01-28 14:16:10,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.2) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-01-28 14:16:10,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3814 states and 7359 transitions. [2022-01-28 14:16:10,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-28 14:16:10,969 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:10,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:10,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-28 14:16:10,969 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:10,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1597179399, now seen corresponding path program 1 times [2022-01-28 14:16:10,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:10,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456788058] [2022-01-28 14:16:10,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:10,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:11,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:11,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456788058] [2022-01-28 14:16:11,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456788058] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:11,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:11,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-28 14:16:11,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400823485] [2022-01-28 14:16:11,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:11,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 14:16:11,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:11,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 14:16:11,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-28 14:16:11,091 INFO L87 Difference]: Start difference. First operand 3814 states and 7359 transitions. Second operand has 6 states, 5 states have (on average 31.4) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 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-01-28 14:16:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:11,474 INFO L93 Difference]: Finished difference Result 5735 states and 11111 transitions. [2022-01-28 14:16:11,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 14:16:11,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 31.4) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2022-01-28 14:16:11,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:11,485 INFO L225 Difference]: With dead ends: 5735 [2022-01-28 14:16:11,485 INFO L226 Difference]: Without dead ends: 5735 [2022-01-28 14:16:11,486 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-01-28 14:16:11,487 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 205 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:11,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 832 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-28 14:16:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2022-01-28 14:16:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 3917. [2022-01-28 14:16:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3917 states, 3889 states have (on average 1.9444587297505787) internal successors, (7562), 3916 states have internal predecessors, (7562), 0 states have call successors, (0), 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-01-28 14:16:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3917 states to 3917 states and 7562 transitions. [2022-01-28 14:16:11,551 INFO L78 Accepts]: Start accepts. Automaton has 3917 states and 7562 transitions. Word has length 157 [2022-01-28 14:16:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:11,552 INFO L470 AbstractCegarLoop]: Abstraction has 3917 states and 7562 transitions. [2022-01-28 14:16:11,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.4) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 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-01-28 14:16:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3917 states and 7562 transitions. [2022-01-28 14:16:11,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-28 14:16:11,554 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:11,554 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:11,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-28 14:16:11,554 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:11,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:11,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2099699453, now seen corresponding path program 1 times [2022-01-28 14:16:11,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:11,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486667483] [2022-01-28 14:16:11,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:11,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:11,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:11,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486667483] [2022-01-28 14:16:11,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486667483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:11,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:11,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-28 14:16:11,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477898049] [2022-01-28 14:16:11,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:11,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 14:16:11,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:11,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 14:16:11,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-28 14:16:11,661 INFO L87 Difference]: Start difference. First operand 3917 states and 7562 transitions. Second operand has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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-01-28 14:16:11,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:11,923 INFO L93 Difference]: Finished difference Result 3863 states and 7455 transitions. [2022-01-28 14:16:11,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 14:16:11,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2022-01-28 14:16:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:11,929 INFO L225 Difference]: With dead ends: 3863 [2022-01-28 14:16:11,929 INFO L226 Difference]: Without dead ends: 3863 [2022-01-28 14:16:11,930 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-01-28 14:16:11,930 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 160 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:11,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 788 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-28 14:16:11,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2022-01-28 14:16:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 3863. [2022-01-28 14:16:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3863 states, 3839 states have (on average 1.9419119562386038) internal successors, (7455), 3862 states have internal predecessors, (7455), 0 states have call successors, (0), 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-01-28 14:16:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 7455 transitions. [2022-01-28 14:16:11,988 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 7455 transitions. Word has length 163 [2022-01-28 14:16:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:11,989 INFO L470 AbstractCegarLoop]: Abstraction has 3863 states and 7455 transitions. [2022-01-28 14:16:11,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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-01-28 14:16:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 7455 transitions. [2022-01-28 14:16:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-01-28 14:16:11,990 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:11,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:11,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-28 14:16:11,990 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:11,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:11,991 INFO L85 PathProgramCache]: Analyzing trace with hash 449131661, now seen corresponding path program 1 times [2022-01-28 14:16:11,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:11,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425859284] [2022-01-28 14:16:11,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:11,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:12,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:12,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425859284] [2022-01-28 14:16:12,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425859284] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:12,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:12,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-28 14:16:12,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858604567] [2022-01-28 14:16:12,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:12,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 14:16:12,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:12,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 14:16:12,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-28 14:16:12,075 INFO L87 Difference]: Start difference. First operand 3863 states and 7455 transitions. Second operand has 6 states, 5 states have (on average 33.4) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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-01-28 14:16:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:12,385 INFO L93 Difference]: Finished difference Result 5144 states and 9941 transitions. [2022-01-28 14:16:12,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 14:16:12,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 33.4) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2022-01-28 14:16:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:12,393 INFO L225 Difference]: With dead ends: 5144 [2022-01-28 14:16:12,393 INFO L226 Difference]: Without dead ends: 5064 [2022-01-28 14:16:12,393 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-01-28 14:16:12,394 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 221 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:12,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 655 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-28 14:16:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2022-01-28 14:16:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 4109. [2022-01-28 14:16:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4109 states, 4085 states have (on average 1.9414932680538555) internal successors, (7931), 4108 states have internal predecessors, (7931), 0 states have call successors, (0), 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-01-28 14:16:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 7931 transitions. [2022-01-28 14:16:12,443 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 7931 transitions. Word has length 167 [2022-01-28 14:16:12,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:12,444 INFO L470 AbstractCegarLoop]: Abstraction has 4109 states and 7931 transitions. [2022-01-28 14:16:12,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.4) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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-01-28 14:16:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 7931 transitions. [2022-01-28 14:16:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-01-28 14:16:12,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:12,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:12,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-28 14:16:12,445 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:12,446 INFO L85 PathProgramCache]: Analyzing trace with hash 544060034, now seen corresponding path program 1 times [2022-01-28 14:16:12,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:12,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170756571] [2022-01-28 14:16:12,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:12,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:12,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:12,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170756571] [2022-01-28 14:16:12,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170756571] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:12,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:12,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-28 14:16:12,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472075637] [2022-01-28 14:16:12,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:12,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 14:16:12,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:12,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 14:16:12,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-28 14:16:12,528 INFO L87 Difference]: Start difference. First operand 4109 states and 7931 transitions. Second operand has 6 states, 5 states have (on average 34.2) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 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-01-28 14:16:12,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:12,739 INFO L93 Difference]: Finished difference Result 4342 states and 8392 transitions. [2022-01-28 14:16:12,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 14:16:12,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 34.2) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2022-01-28 14:16:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:12,749 INFO L225 Difference]: With dead ends: 4342 [2022-01-28 14:16:12,749 INFO L226 Difference]: Without dead ends: 4342 [2022-01-28 14:16:12,750 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-01-28 14:16:12,750 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 154 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:12,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 687 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-28 14:16:12,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2022-01-28 14:16:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 4286. [2022-01-28 14:16:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4286 states, 4262 states have (on average 1.9429845143125293) internal successors, (8281), 4285 states have internal predecessors, (8281), 0 states have call successors, (0), 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-01-28 14:16:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 8281 transitions. [2022-01-28 14:16:12,832 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 8281 transitions. Word has length 171 [2022-01-28 14:16:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:12,833 INFO L470 AbstractCegarLoop]: Abstraction has 4286 states and 8281 transitions. [2022-01-28 14:16:12,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.2) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 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-01-28 14:16:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 8281 transitions. [2022-01-28 14:16:12,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-01-28 14:16:12,835 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:12,835 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:12,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-28 14:16:12,835 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-01-28 14:16:12,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:12,835 INFO L85 PathProgramCache]: Analyzing trace with hash 654097040, now seen corresponding path program 1 times [2022-01-28 14:16:12,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:12,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437027734] [2022-01-28 14:16:12,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:12,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:12,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:12,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437027734] [2022-01-28 14:16:12,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437027734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:12,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:12,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-28 14:16:12,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799733711] [2022-01-28 14:16:12,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:12,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 14:16:12,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:12,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 14:16:12,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-28 14:16:12,927 INFO L87 Difference]: Start difference. First operand 4286 states and 8281 transitions. Second operand has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 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-01-28 14:16:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:13,511 INFO L93 Difference]: Finished difference Result 4766 states and 9176 transitions. [2022-01-28 14:16:13,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 14:16:13,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2022-01-28 14:16:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:13,520 INFO L225 Difference]: With dead ends: 4766 [2022-01-28 14:16:13,520 INFO L226 Difference]: Without dead ends: 4502 [2022-01-28 14:16:13,520 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-01-28 14:16:13,520 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 287 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:13,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 1158 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-28 14:16:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2022-01-28 14:16:13,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 4055. [2022-01-28 14:16:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4055 states, 4036 states have (on average 1.929633300297324) internal successors, (7788), 4054 states have internal predecessors, (7788), 0 states have call successors, (0), 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-01-28 14:16:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 7788 transitions. [2022-01-28 14:16:13,579 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 7788 transitions. Word has length 179 [2022-01-28 14:16:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:13,580 INFO L470 AbstractCegarLoop]: Abstraction has 4055 states and 7788 transitions. [2022-01-28 14:16:13,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 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-01-28 14:16:13,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 7788 transitions. [2022-01-28 14:16:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-01-28 14:16:13,582 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:13,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:13,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-28 14:16:13,582 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:13,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:13,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1572605453, now seen corresponding path program 1 times [2022-01-28 14:16:13,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:13,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034631738] [2022-01-28 14:16:13,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:13,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:13,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:13,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034631738] [2022-01-28 14:16:13,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034631738] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:13,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:13,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-28 14:16:13,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264282848] [2022-01-28 14:16:13,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:13,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-28 14:16:13,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:13,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-28 14:16:13,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 14:16:13,632 INFO L87 Difference]: Start difference. First operand 4055 states and 7788 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-01-28 14:16:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:13,652 INFO L93 Difference]: Finished difference Result 3270 states and 6142 transitions. [2022-01-28 14:16:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-28 14:16:13,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2022-01-28 14:16:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:13,658 INFO L225 Difference]: With dead ends: 3270 [2022-01-28 14:16:13,658 INFO L226 Difference]: Without dead ends: 3270 [2022-01-28 14:16:13,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 14:16:13,659 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 99 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:13,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 548 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 14:16:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2022-01-28 14:16:13,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3074. [2022-01-28 14:16:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 3059 states have (on average 1.888852566198104) internal successors, (5778), 3073 states have internal predecessors, (5778), 0 states have call successors, (0), 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-01-28 14:16:13,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 5778 transitions. [2022-01-28 14:16:13,693 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 5778 transitions. Word has length 179 [2022-01-28 14:16:13,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:13,693 INFO L470 AbstractCegarLoop]: Abstraction has 3074 states and 5778 transitions. [2022-01-28 14:16:13,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-01-28 14:16:13,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 5778 transitions. [2022-01-28 14:16:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-01-28 14:16:13,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:13,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:13,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-28 14:16:13,695 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:13,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:13,696 INFO L85 PathProgramCache]: Analyzing trace with hash 859331813, now seen corresponding path program 1 times [2022-01-28 14:16:13,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:13,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327527579] [2022-01-28 14:16:13,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:13,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:13,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:13,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327527579] [2022-01-28 14:16:13,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327527579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:13,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:13,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-28 14:16:13,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303009890] [2022-01-28 14:16:13,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:13,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 14:16:13,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:13,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 14:16:13,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-28 14:16:13,797 INFO L87 Difference]: Start difference. First operand 3074 states and 5778 transitions. Second operand has 6 states, 5 states have (on average 38.4) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 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-01-28 14:16:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:14,106 INFO L93 Difference]: Finished difference Result 3017 states and 5666 transitions. [2022-01-28 14:16:14,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 14:16:14,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 38.4) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 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 192 [2022-01-28 14:16:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:14,112 INFO L225 Difference]: With dead ends: 3017 [2022-01-28 14:16:14,112 INFO L226 Difference]: Without dead ends: 3017 [2022-01-28 14:16:14,113 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-01-28 14:16:14,114 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 148 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:14,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 976 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-28 14:16:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2022-01-28 14:16:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 3017. [2022-01-28 14:16:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3005 states have (on average 1.8855241264559068) internal successors, (5666), 3016 states have internal predecessors, (5666), 0 states have call successors, (0), 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-01-28 14:16:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 5666 transitions. [2022-01-28 14:16:14,182 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 5666 transitions. Word has length 192 [2022-01-28 14:16:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:14,182 INFO L470 AbstractCegarLoop]: Abstraction has 3017 states and 5666 transitions. [2022-01-28 14:16:14,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 38.4) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 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-01-28 14:16:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 5666 transitions. [2022-01-28 14:16:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-28 14:16:14,185 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:14,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:14,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-28 14:16:14,185 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-01-28 14:16:14,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:14,186 INFO L85 PathProgramCache]: Analyzing trace with hash 247325162, now seen corresponding path program 1 times [2022-01-28 14:16:14,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:14,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143943538] [2022-01-28 14:16:14,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:14,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:14,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:14,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143943538] [2022-01-28 14:16:14,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143943538] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:14,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:14,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-28 14:16:14,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554956943] [2022-01-28 14:16:14,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:14,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-28 14:16:14,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:14,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-28 14:16:14,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-01-28 14:16:14,716 INFO L87 Difference]: Start difference. First operand 3017 states and 5666 transitions. Second operand has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 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-01-28 14:16:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:16,286 INFO L93 Difference]: Finished difference Result 4046 states and 7656 transitions. [2022-01-28 14:16:16,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-28 14:16:16,287 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2022-01-28 14:16:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:16,294 INFO L225 Difference]: With dead ends: 4046 [2022-01-28 14:16:16,294 INFO L226 Difference]: Without dead ends: 4046 [2022-01-28 14:16:16,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=295, Invalid=1427, Unknown=0, NotChecked=0, Total=1722 [2022-01-28 14:16:16,295 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 1427 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 2423 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:16,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1427 Valid, 2423 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-28 14:16:16,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4046 states. [2022-01-28 14:16:16,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4046 to 3036. [2022-01-28 14:16:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3024 states have (on average 1.8862433862433863) internal successors, (5704), 3035 states have internal predecessors, (5704), 0 states have call successors, (0), 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-01-28 14:16:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 5704 transitions. [2022-01-28 14:16:16,359 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 5704 transitions. Word has length 200 [2022-01-28 14:16:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:16,359 INFO L470 AbstractCegarLoop]: Abstraction has 3036 states and 5704 transitions. [2022-01-28 14:16:16,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 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-01-28 14:16:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 5704 transitions. [2022-01-28 14:16:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-28 14:16:16,361 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:16,361 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:16,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-28 14:16:16,361 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:16,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2112059964, now seen corresponding path program 2 times [2022-01-28 14:16:16,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:16,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080204921] [2022-01-28 14:16:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:16,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:16,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:16,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080204921] [2022-01-28 14:16:16,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080204921] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:16,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:16,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-28 14:16:16,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527902584] [2022-01-28 14:16:16,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:16,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-28 14:16:16,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:16,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-28 14:16:16,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-01-28 14:16:16,903 INFO L87 Difference]: Start difference. First operand 3036 states and 5704 transitions. Second operand has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 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-01-28 14:16:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:18,472 INFO L93 Difference]: Finished difference Result 4129 states and 7822 transitions. [2022-01-28 14:16:18,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-28 14:16:18,473 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2022-01-28 14:16:18,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:18,480 INFO L225 Difference]: With dead ends: 4129 [2022-01-28 14:16:18,480 INFO L226 Difference]: Without dead ends: 4129 [2022-01-28 14:16:18,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1653, Unknown=0, NotChecked=0, Total=1980 [2022-01-28 14:16:18,481 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1466 mSDsluCounter, 2166 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 2420 SdHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:18,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1466 Valid, 2420 Invalid, 2498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-28 14:16:18,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2022-01-28 14:16:18,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3059. [2022-01-28 14:16:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 3047 states have (on average 1.8871020676074828) internal successors, (5750), 3058 states have internal predecessors, (5750), 0 states have call successors, (0), 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-01-28 14:16:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 5750 transitions. [2022-01-28 14:16:18,557 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 5750 transitions. Word has length 200 [2022-01-28 14:16:18,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:18,558 INFO L470 AbstractCegarLoop]: Abstraction has 3059 states and 5750 transitions. [2022-01-28 14:16:18,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 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-01-28 14:16:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 5750 transitions. [2022-01-28 14:16:18,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-28 14:16:18,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:18,560 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:18,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-28 14:16:18,561 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:18,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:18,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1483591062, now seen corresponding path program 3 times [2022-01-28 14:16:18,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:18,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549821261] [2022-01-28 14:16:18,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:18,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:19,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:19,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549821261] [2022-01-28 14:16:19,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549821261] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:19,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:19,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-28 14:16:19,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730057607] [2022-01-28 14:16:19,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:19,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-28 14:16:19,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:19,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-28 14:16:19,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-01-28 14:16:19,456 INFO L87 Difference]: Start difference. First operand 3059 states and 5750 transitions. Second operand has 23 states, 22 states have (on average 9.090909090909092) internal successors, (200), 23 states have internal predecessors, (200), 0 states have call successors, (0), 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-01-28 14:16:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:21,751 INFO L93 Difference]: Finished difference Result 4567 states and 8691 transitions. [2022-01-28 14:16:21,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-28 14:16:21,752 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 9.090909090909092) internal successors, (200), 23 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2022-01-28 14:16:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:21,758 INFO L225 Difference]: With dead ends: 4567 [2022-01-28 14:16:21,758 INFO L226 Difference]: Without dead ends: 4567 [2022-01-28 14:16:21,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=517, Invalid=2345, Unknown=0, NotChecked=0, Total=2862 [2022-01-28 14:16:21,759 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 1526 mSDsluCounter, 2427 mSDsCounter, 0 mSdLazyCounter, 2154 mSolverCounterSat, 576 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 2675 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 576 IncrementalHoareTripleChecker+Valid, 2154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:21,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1526 Valid, 2675 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [576 Valid, 2154 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-28 14:16:21,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4567 states. [2022-01-28 14:16:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4567 to 3083. [2022-01-28 14:16:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 3071 states have (on average 1.8883099967437318) internal successors, (5799), 3082 states have internal predecessors, (5799), 0 states have call successors, (0), 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-01-28 14:16:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 5799 transitions. [2022-01-28 14:16:21,806 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 5799 transitions. Word has length 200 [2022-01-28 14:16:21,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:21,806 INFO L470 AbstractCegarLoop]: Abstraction has 3083 states and 5799 transitions. [2022-01-28 14:16:21,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.090909090909092) internal successors, (200), 23 states have internal predecessors, (200), 0 states have call successors, (0), 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-01-28 14:16:21,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 5799 transitions. [2022-01-28 14:16:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-28 14:16:21,808 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:21,808 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:21,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-28 14:16:21,809 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:21,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash -537915958, now seen corresponding path program 4 times [2022-01-28 14:16:21,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:21,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944045573] [2022-01-28 14:16:21,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:21,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:22,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:22,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944045573] [2022-01-28 14:16:22,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944045573] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:22,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:22,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-28 14:16:22,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902875645] [2022-01-28 14:16:22,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:22,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-28 14:16:22,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:22,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-28 14:16:22,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-01-28 14:16:22,315 INFO L87 Difference]: Start difference. First operand 3083 states and 5799 transitions. Second operand has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 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-01-28 14:16:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:24,447 INFO L93 Difference]: Finished difference Result 4559 states and 8657 transitions. [2022-01-28 14:16:24,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-28 14:16:24,447 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2022-01-28 14:16:24,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:24,452 INFO L225 Difference]: With dead ends: 4559 [2022-01-28 14:16:24,452 INFO L226 Difference]: Without dead ends: 4559 [2022-01-28 14:16:24,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=523, Invalid=2447, Unknown=0, NotChecked=0, Total=2970 [2022-01-28 14:16:24,454 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 1320 mSDsluCounter, 3285 mSDsCounter, 0 mSdLazyCounter, 3059 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 3719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 3059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:24,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1320 Valid, 3535 Invalid, 3719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 3059 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-28 14:16:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4559 states. [2022-01-28 14:16:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4559 to 3107. [2022-01-28 14:16:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3107 states, 3095 states have (on average 1.8894991922455573) internal successors, (5848), 3106 states have internal predecessors, (5848), 0 states have call successors, (0), 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-01-28 14:16:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 5848 transitions. [2022-01-28 14:16:24,490 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 5848 transitions. Word has length 200 [2022-01-28 14:16:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:24,491 INFO L470 AbstractCegarLoop]: Abstraction has 3107 states and 5848 transitions. [2022-01-28 14:16:24,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 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-01-28 14:16:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 5848 transitions. [2022-01-28 14:16:24,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-28 14:16:24,494 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:24,494 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:24,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-28 14:16:24,495 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-01-28 14:16:24,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:24,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1859248506, now seen corresponding path program 5 times [2022-01-28 14:16:24,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:24,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004304325] [2022-01-28 14:16:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:24,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:24,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:24,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004304325] [2022-01-28 14:16:24,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004304325] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:24,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:24,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-28 14:16:24,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997169528] [2022-01-28 14:16:24,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:24,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-28 14:16:24,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:24,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-28 14:16:24,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-01-28 14:16:24,991 INFO L87 Difference]: Start difference. First operand 3107 states and 5848 transitions. Second operand has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 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-01-28 14:16:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:26,724 INFO L93 Difference]: Finished difference Result 3564 states and 6712 transitions. [2022-01-28 14:16:26,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-28 14:16:26,724 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2022-01-28 14:16:26,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:26,728 INFO L225 Difference]: With dead ends: 3564 [2022-01-28 14:16:26,728 INFO L226 Difference]: Without dead ends: 3564 [2022-01-28 14:16:26,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=512, Invalid=2244, Unknown=0, NotChecked=0, Total=2756 [2022-01-28 14:16:26,729 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 1582 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 499 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:26,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1582 Valid, 2282 Invalid, 2554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-28 14:16:26,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2022-01-28 14:16:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 2990. [2022-01-28 14:16:26,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 2979 states have (on average 1.8848606915072172) internal successors, (5615), 2989 states have internal predecessors, (5615), 0 states have call successors, (0), 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-01-28 14:16:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 5615 transitions. [2022-01-28 14:16:26,757 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 5615 transitions. Word has length 200 [2022-01-28 14:16:26,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:26,757 INFO L470 AbstractCegarLoop]: Abstraction has 2990 states and 5615 transitions. [2022-01-28 14:16:26,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 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-01-28 14:16:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 5615 transitions. [2022-01-28 14:16:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-28 14:16:26,759 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:26,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-28 14:16:26,760 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash 34158403, now seen corresponding path program 1 times [2022-01-28 14:16:26,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:26,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692953525] [2022-01-28 14:16:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:26,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:27,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:27,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692953525] [2022-01-28 14:16:27,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692953525] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:27,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:27,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-28 14:16:27,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249068716] [2022-01-28 14:16:27,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:27,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-28 14:16:27,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:27,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-28 14:16:27,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-01-28 14:16:27,122 INFO L87 Difference]: Start difference. First operand 2990 states and 5615 transitions. Second operand has 19 states, 18 states have (on average 11.11111111111111) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 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-01-28 14:16:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:28,238 INFO L93 Difference]: Finished difference Result 2998 states and 5627 transitions. [2022-01-28 14:16:28,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-28 14:16:28,238 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 11.11111111111111) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2022-01-28 14:16:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:28,241 INFO L225 Difference]: With dead ends: 2998 [2022-01-28 14:16:28,242 INFO L226 Difference]: Without dead ends: 2998 [2022-01-28 14:16:28,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=323, Invalid=1657, Unknown=0, NotChecked=0, Total=1980 [2022-01-28 14:16:28,243 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 1144 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 2746 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:28,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1144 Valid, 2746 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-28 14:16:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2022-01-28 14:16:28,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2945. [2022-01-28 14:16:28,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2945 states, 2934 states have (on average 1.882072256305385) internal successors, (5522), 2944 states have internal predecessors, (5522), 0 states have call successors, (0), 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-01-28 14:16:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 5522 transitions. [2022-01-28 14:16:28,274 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 5522 transitions. Word has length 200 [2022-01-28 14:16:28,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:28,275 INFO L470 AbstractCegarLoop]: Abstraction has 2945 states and 5522 transitions. [2022-01-28 14:16:28,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 11.11111111111111) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 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-01-28 14:16:28,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 5522 transitions. [2022-01-28 14:16:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-28 14:16:28,279 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:28,279 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:28,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-28 14:16:28,279 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:28,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:28,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1838917866, now seen corresponding path program 1 times [2022-01-28 14:16:28,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:28,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704370048] [2022-01-28 14:16:28,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:28,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:28,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:28,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704370048] [2022-01-28 14:16:28,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704370048] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:28,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:28,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-28 14:16:28,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571522927] [2022-01-28 14:16:28,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:28,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 14:16:28,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:28,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 14:16:28,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-28 14:16:28,362 INFO L87 Difference]: Start difference. First operand 2945 states and 5522 transitions. Second operand has 6 states, 5 states have (on average 40.0) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 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-01-28 14:16:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:28,697 INFO L93 Difference]: Finished difference Result 3137 states and 5871 transitions. [2022-01-28 14:16:28,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 14:16:28,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 40.0) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2022-01-28 14:16:28,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:28,700 INFO L225 Difference]: With dead ends: 3137 [2022-01-28 14:16:28,700 INFO L226 Difference]: Without dead ends: 2651 [2022-01-28 14:16:28,701 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-01-28 14:16:28,702 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 153 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:28,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 846 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-28 14:16:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2651 states. [2022-01-28 14:16:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2651 to 2635. [2022-01-28 14:16:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2624 states have (on average 1.8467987804878048) internal successors, (4846), 2634 states have internal predecessors, (4846), 0 states have call successors, (0), 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-01-28 14:16:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 4846 transitions. [2022-01-28 14:16:28,729 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 4846 transitions. Word has length 200 [2022-01-28 14:16:28,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:28,729 INFO L470 AbstractCegarLoop]: Abstraction has 2635 states and 4846 transitions. [2022-01-28 14:16:28,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 40.0) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 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-01-28 14:16:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 4846 transitions. [2022-01-28 14:16:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-01-28 14:16:28,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:28,732 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:28,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-28 14:16:28,732 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-01-28 14:16:28,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:28,732 INFO L85 PathProgramCache]: Analyzing trace with hash -979472995, now seen corresponding path program 1 times [2022-01-28 14:16:28,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:28,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305763066] [2022-01-28 14:16:28,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:28,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:29,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:29,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305763066] [2022-01-28 14:16:29,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305763066] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:29,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:29,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-28 14:16:29,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908953222] [2022-01-28 14:16:29,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:29,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-28 14:16:29,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:29,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-28 14:16:29,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-01-28 14:16:29,182 INFO L87 Difference]: Start difference. First operand 2635 states and 4846 transitions. Second operand has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:30,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:30,460 INFO L93 Difference]: Finished difference Result 3393 states and 6256 transitions. [2022-01-28 14:16:30,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-28 14:16:30,460 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-01-28 14:16:30,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:30,464 INFO L225 Difference]: With dead ends: 3393 [2022-01-28 14:16:30,464 INFO L226 Difference]: Without dead ends: 3393 [2022-01-28 14:16:30,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=299, Invalid=1507, Unknown=0, NotChecked=0, Total=1806 [2022-01-28 14:16:30,468 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1266 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:30,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1266 Valid, 2411 Invalid, 2178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 1881 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-28 14:16:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2022-01-28 14:16:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 2653. [2022-01-28 14:16:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2642 states have (on average 1.8478425435276307) internal successors, (4882), 2652 states have internal predecessors, (4882), 0 states have call successors, (0), 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-01-28 14:16:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 4882 transitions. [2022-01-28 14:16:30,508 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 4882 transitions. Word has length 205 [2022-01-28 14:16:30,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:30,508 INFO L470 AbstractCegarLoop]: Abstraction has 2653 states and 4882 transitions. [2022-01-28 14:16:30,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 4882 transitions. [2022-01-28 14:16:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-01-28 14:16:30,513 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:30,513 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:30,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-28 14:16:30,513 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-01-28 14:16:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:30,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1289205875, now seen corresponding path program 2 times [2022-01-28 14:16:30,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:30,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295637207] [2022-01-28 14:16:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:30,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:31,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:31,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295637207] [2022-01-28 14:16:31,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295637207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:31,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:31,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-28 14:16:31,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664407439] [2022-01-28 14:16:31,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:31,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-28 14:16:31,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:31,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-28 14:16:31,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-01-28 14:16:31,002 INFO L87 Difference]: Start difference. First operand 2653 states and 4882 transitions. Second operand has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:32,192 INFO L93 Difference]: Finished difference Result 3445 states and 6360 transitions. [2022-01-28 14:16:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-28 14:16:32,193 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-01-28 14:16:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:32,197 INFO L225 Difference]: With dead ends: 3445 [2022-01-28 14:16:32,197 INFO L226 Difference]: Without dead ends: 3445 [2022-01-28 14:16:32,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=322, Invalid=1658, Unknown=0, NotChecked=0, Total=1980 [2022-01-28 14:16:32,200 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 1043 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 2691 SdHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:32,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1043 Valid, 2691 Invalid, 2441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-28 14:16:32,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2022-01-28 14:16:32,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 2673. [2022-01-28 14:16:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2662 states have (on average 1.8489857250187829) internal successors, (4922), 2672 states have internal predecessors, (4922), 0 states have call successors, (0), 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-01-28 14:16:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4922 transitions. [2022-01-28 14:16:32,260 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4922 transitions. Word has length 205 [2022-01-28 14:16:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:32,260 INFO L470 AbstractCegarLoop]: Abstraction has 2673 states and 4922 transitions. [2022-01-28 14:16:32,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4922 transitions. [2022-01-28 14:16:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-01-28 14:16:32,263 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:32,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:32,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-28 14:16:32,267 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-01-28 14:16:32,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1265094627, now seen corresponding path program 3 times [2022-01-28 14:16:32,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:32,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412136235] [2022-01-28 14:16:32,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:32,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:32,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-01-28 14:16:32,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:32,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412136235] [2022-01-28 14:16:32,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412136235] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:32,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:32,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-28 14:16:32,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799105039] [2022-01-28 14:16:32,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:32,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-28 14:16:32,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:32,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-28 14:16:32,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-01-28 14:16:32,736 INFO L87 Difference]: Start difference. First operand 2673 states and 4922 transitions. Second operand has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:34,253 INFO L93 Difference]: Finished difference Result 3441 states and 6352 transitions. [2022-01-28 14:16:34,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-28 14:16:34,253 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-01-28 14:16:34,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:34,257 INFO L225 Difference]: With dead ends: 3441 [2022-01-28 14:16:34,257 INFO L226 Difference]: Without dead ends: 3441 [2022-01-28 14:16:34,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=350, Invalid=1720, Unknown=0, NotChecked=0, Total=2070 [2022-01-28 14:16:34,258 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 1044 mSDsluCounter, 2524 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:34,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1044 Valid, 2785 Invalid, 2554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-28 14:16:34,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2022-01-28 14:16:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 2671. [2022-01-28 14:16:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2671 states, 2660 states have (on average 1.848872180451128) internal successors, (4918), 2670 states have internal predecessors, (4918), 0 states have call successors, (0), 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-01-28 14:16:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 4918 transitions. [2022-01-28 14:16:34,286 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 4918 transitions. Word has length 205 [2022-01-28 14:16:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:34,286 INFO L470 AbstractCegarLoop]: Abstraction has 2671 states and 4918 transitions. [2022-01-28 14:16:34,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 4918 transitions. [2022-01-28 14:16:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-01-28 14:16:34,292 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:34,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:34,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-28 14:16:34,293 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-01-28 14:16:34,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1042183327, now seen corresponding path program 4 times [2022-01-28 14:16:34,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:34,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350238433] [2022-01-28 14:16:34,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:34,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:34,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:34,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350238433] [2022-01-28 14:16:34,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350238433] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:34,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:34,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-28 14:16:34,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862210390] [2022-01-28 14:16:34,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:34,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-28 14:16:34,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:34,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-28 14:16:34,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-01-28 14:16:34,743 INFO L87 Difference]: Start difference. First operand 2671 states and 4918 transitions. Second operand has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:36,231 INFO L93 Difference]: Finished difference Result 3854 states and 7151 transitions. [2022-01-28 14:16:36,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-28 14:16:36,232 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-01-28 14:16:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:36,236 INFO L225 Difference]: With dead ends: 3854 [2022-01-28 14:16:36,236 INFO L226 Difference]: Without dead ends: 3854 [2022-01-28 14:16:36,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=480, Invalid=2172, Unknown=0, NotChecked=0, Total=2652 [2022-01-28 14:16:36,237 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 1196 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:36,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1196 Valid, 2693 Invalid, 2830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-28 14:16:36,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3854 states. [2022-01-28 14:16:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3854 to 2711. [2022-01-28 14:16:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2700 states have (on average 1.8511111111111112) internal successors, (4998), 2710 states have internal predecessors, (4998), 0 states have call successors, (0), 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-01-28 14:16:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 4998 transitions. [2022-01-28 14:16:36,265 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 4998 transitions. Word has length 205 [2022-01-28 14:16:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:36,265 INFO L470 AbstractCegarLoop]: Abstraction has 2711 states and 4998 transitions. [2022-01-28 14:16:36,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 4998 transitions. [2022-01-28 14:16:36,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-01-28 14:16:36,267 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:36,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:36,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-28 14:16:36,268 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-01-28 14:16:36,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:36,268 INFO L85 PathProgramCache]: Analyzing trace with hash -106384083, now seen corresponding path program 5 times [2022-01-28 14:16:36,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:36,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936692209] [2022-01-28 14:16:36,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:36,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:36,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-01-28 14:16:36,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:36,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936692209] [2022-01-28 14:16:36,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936692209] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:36,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:36,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-28 14:16:36,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942929503] [2022-01-28 14:16:36,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:36,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-28 14:16:36,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:36,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-28 14:16:36,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-01-28 14:16:36,735 INFO L87 Difference]: Start difference. First operand 2711 states and 4998 transitions. Second operand has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:38,457 INFO L93 Difference]: Finished difference Result 3857 states and 7157 transitions. [2022-01-28 14:16:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-28 14:16:38,457 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-01-28 14:16:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:38,461 INFO L225 Difference]: With dead ends: 3857 [2022-01-28 14:16:38,462 INFO L226 Difference]: Without dead ends: 3857 [2022-01-28 14:16:38,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=555, Invalid=2415, Unknown=0, NotChecked=0, Total=2970 [2022-01-28 14:16:38,463 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 1369 mSDsluCounter, 2916 mSDsCounter, 0 mSdLazyCounter, 2642 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 3183 SdHoareTripleChecker+Invalid, 3133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 2642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:38,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1369 Valid, 3183 Invalid, 3133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 2642 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-28 14:16:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2022-01-28 14:16:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 2691. [2022-01-28 14:16:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 2680 states have (on average 1.85) internal successors, (4958), 2690 states have internal predecessors, (4958), 0 states have call successors, (0), 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-01-28 14:16:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 4958 transitions. [2022-01-28 14:16:38,512 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 4958 transitions. Word has length 205 [2022-01-28 14:16:38,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:38,512 INFO L470 AbstractCegarLoop]: Abstraction has 2691 states and 4958 transitions. [2022-01-28 14:16:38,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 4958 transitions. [2022-01-28 14:16:38,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-01-28 14:16:38,515 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:38,515 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:38,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-28 14:16:38,516 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-01-28 14:16:38,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:38,516 INFO L85 PathProgramCache]: Analyzing trace with hash 337813469, now seen corresponding path program 6 times [2022-01-28 14:16:38,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:38,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426034156] [2022-01-28 14:16:38,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:38,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:39,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:39,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426034156] [2022-01-28 14:16:39,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426034156] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:39,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:39,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-01-28 14:16:39,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344539359] [2022-01-28 14:16:39,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:39,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-28 14:16:39,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:39,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-28 14:16:39,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-01-28 14:16:39,362 INFO L87 Difference]: Start difference. First operand 2691 states and 4958 transitions. Second operand has 23 states, 22 states have (on average 9.318181818181818) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:41,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:41,226 INFO L93 Difference]: Finished difference Result 4732 states and 8813 transitions. [2022-01-28 14:16:41,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-28 14:16:41,226 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 9.318181818181818) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-01-28 14:16:41,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:41,231 INFO L225 Difference]: With dead ends: 4732 [2022-01-28 14:16:41,231 INFO L226 Difference]: Without dead ends: 4732 [2022-01-28 14:16:41,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=730, Invalid=3176, Unknown=0, NotChecked=0, Total=3906 [2022-01-28 14:16:41,232 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 1554 mSDsluCounter, 2478 mSDsCounter, 0 mSdLazyCounter, 2113 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 2113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:41,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1554 Valid, 2745 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 2113 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-28 14:16:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4732 states. [2022-01-28 14:16:41,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4732 to 2689. [2022-01-28 14:16:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2678 states have (on average 1.8498879761015683) internal successors, (4954), 2688 states have internal predecessors, (4954), 0 states have call successors, (0), 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-01-28 14:16:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 4954 transitions. [2022-01-28 14:16:41,262 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 4954 transitions. Word has length 205 [2022-01-28 14:16:41,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:41,262 INFO L470 AbstractCegarLoop]: Abstraction has 2689 states and 4954 transitions. [2022-01-28 14:16:41,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.318181818181818) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:41,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 4954 transitions. [2022-01-28 14:16:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-01-28 14:16:41,264 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:41,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:41,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-28 14:16:41,264 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:41,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:41,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2143987693, now seen corresponding path program 7 times [2022-01-28 14:16:41,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:41,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46607655] [2022-01-28 14:16:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:41,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:41,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:41,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46607655] [2022-01-28 14:16:41,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46607655] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:41,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:41,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-28 14:16:41,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754221697] [2022-01-28 14:16:41,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:41,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-28 14:16:41,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:41,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-28 14:16:41,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-01-28 14:16:41,660 INFO L87 Difference]: Start difference. First operand 2689 states and 4954 transitions. Second operand has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:42,777 INFO L93 Difference]: Finished difference Result 3238 states and 5997 transitions. [2022-01-28 14:16:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-28 14:16:42,777 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-01-28 14:16:42,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:42,780 INFO L225 Difference]: With dead ends: 3238 [2022-01-28 14:16:42,780 INFO L226 Difference]: Without dead ends: 3238 [2022-01-28 14:16:42,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=457, Invalid=1993, Unknown=0, NotChecked=0, Total=2450 [2022-01-28 14:16:42,781 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 1272 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 2767 SdHoareTripleChecker+Invalid, 2706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:42,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1272 Valid, 2767 Invalid, 2706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 2368 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-28 14:16:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3238 states. [2022-01-28 14:16:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3238 to 2669. [2022-01-28 14:16:42,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2658 states have (on average 1.8487584650112867) internal successors, (4914), 2668 states have internal predecessors, (4914), 0 states have call successors, (0), 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-01-28 14:16:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 4914 transitions. [2022-01-28 14:16:42,838 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 4914 transitions. Word has length 205 [2022-01-28 14:16:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:42,851 INFO L470 AbstractCegarLoop]: Abstraction has 2669 states and 4914 transitions. [2022-01-28 14:16:42,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 4914 transitions. [2022-01-28 14:16:42,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-01-28 14:16:42,861 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:42,861 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:42,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-28 14:16:42,861 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:42,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:42,862 INFO L85 PathProgramCache]: Analyzing trace with hash 266578173, now seen corresponding path program 8 times [2022-01-28 14:16:42,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:42,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025416974] [2022-01-28 14:16:42,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:42,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:43,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:43,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025416974] [2022-01-28 14:16:43,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025416974] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:43,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:43,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-28 14:16:43,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482686441] [2022-01-28 14:16:43,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:43,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-28 14:16:43,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:43,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-28 14:16:43,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-01-28 14:16:43,299 INFO L87 Difference]: Start difference. First operand 2669 states and 4914 transitions. Second operand has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:44,903 INFO L93 Difference]: Finished difference Result 3261 states and 6043 transitions. [2022-01-28 14:16:44,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-28 14:16:44,904 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-01-28 14:16:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:44,907 INFO L225 Difference]: With dead ends: 3261 [2022-01-28 14:16:44,908 INFO L226 Difference]: Without dead ends: 3261 [2022-01-28 14:16:44,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=500, Invalid=2152, Unknown=0, NotChecked=0, Total=2652 [2022-01-28 14:16:44,909 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 1226 mSDsluCounter, 2503 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 2706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:44,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1226 Valid, 2741 Invalid, 2706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-28 14:16:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2022-01-28 14:16:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 2649. [2022-01-28 14:16:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 2638 states have (on average 1.847611827141774) internal successors, (4874), 2648 states have internal predecessors, (4874), 0 states have call successors, (0), 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-01-28 14:16:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 4874 transitions. [2022-01-28 14:16:44,931 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 4874 transitions. Word has length 205 [2022-01-28 14:16:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:44,932 INFO L470 AbstractCegarLoop]: Abstraction has 2649 states and 4874 transitions. [2022-01-28 14:16:44,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 4874 transitions. [2022-01-28 14:16:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-01-28 14:16:44,934 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:44,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:44,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-28 14:16:44,935 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:44,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1760104399, now seen corresponding path program 9 times [2022-01-28 14:16:44,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:44,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552258768] [2022-01-28 14:16:44,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:44,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:45,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:45,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552258768] [2022-01-28 14:16:45,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552258768] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:45,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:45,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-28 14:16:45,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966067702] [2022-01-28 14:16:45,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:45,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-28 14:16:45,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:45,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-28 14:16:45,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-01-28 14:16:45,343 INFO L87 Difference]: Start difference. First operand 2649 states and 4874 transitions. Second operand has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:46,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:46,795 INFO L93 Difference]: Finished difference Result 3095 states and 5722 transitions. [2022-01-28 14:16:46,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-28 14:16:46,795 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-01-28 14:16:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:46,799 INFO L225 Difference]: With dead ends: 3095 [2022-01-28 14:16:46,799 INFO L226 Difference]: Without dead ends: 3095 [2022-01-28 14:16:46,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=672, Invalid=2750, Unknown=0, NotChecked=0, Total=3422 [2022-01-28 14:16:46,800 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 1452 mSDsluCounter, 3055 mSDsCounter, 0 mSdLazyCounter, 2884 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 3360 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 2884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:46,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1452 Valid, 3360 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 2884 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-28 14:16:46,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2022-01-28 14:16:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 2559. [2022-01-28 14:16:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2548 states have (on average 1.846546310832025) internal successors, (4705), 2558 states have internal predecessors, (4705), 0 states have call successors, (0), 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-01-28 14:16:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4705 transitions. [2022-01-28 14:16:46,824 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4705 transitions. Word has length 205 [2022-01-28 14:16:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:46,824 INFO L470 AbstractCegarLoop]: Abstraction has 2559 states and 4705 transitions. [2022-01-28 14:16:46,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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-01-28 14:16:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4705 transitions. [2022-01-28 14:16:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-01-28 14:16:46,826 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:46,826 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:46,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-28 14:16:46,827 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:46,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:46,827 INFO L85 PathProgramCache]: Analyzing trace with hash 624290165, now seen corresponding path program 1 times [2022-01-28 14:16:46,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:46,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763532722] [2022-01-28 14:16:46,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:46,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:47,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:47,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763532722] [2022-01-28 14:16:47,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763532722] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:47,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:47,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-28 14:16:47,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733571411] [2022-01-28 14:16:47,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:47,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-28 14:16:47,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:47,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-28 14:16:47,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2022-01-28 14:16:47,412 INFO L87 Difference]: Start difference. First operand 2559 states and 4705 transitions. Second operand has 26 states, 25 states have (on average 8.32) internal successors, (208), 26 states have internal predecessors, (208), 0 states have call successors, (0), 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-01-28 14:16:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:49,512 INFO L93 Difference]: Finished difference Result 3363 states and 6216 transitions. [2022-01-28 14:16:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-28 14:16:49,512 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 8.32) internal successors, (208), 26 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2022-01-28 14:16:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:49,516 INFO L225 Difference]: With dead ends: 3363 [2022-01-28 14:16:49,516 INFO L226 Difference]: Without dead ends: 3355 [2022-01-28 14:16:49,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=600, Invalid=4092, Unknown=0, NotChecked=0, Total=4692 [2022-01-28 14:16:49,519 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 1454 mSDsluCounter, 3017 mSDsCounter, 0 mSdLazyCounter, 3786 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1454 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 4216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 3786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:49,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1454 Valid, 3246 Invalid, 4216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 3786 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-28 14:16:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2022-01-28 14:16:49,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 2637. [2022-01-28 14:16:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2637 states, 2626 states have (on average 1.8514851485148516) internal successors, (4862), 2636 states have internal predecessors, (4862), 0 states have call successors, (0), 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-01-28 14:16:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 4862 transitions. [2022-01-28 14:16:49,542 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 4862 transitions. Word has length 208 [2022-01-28 14:16:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:49,542 INFO L470 AbstractCegarLoop]: Abstraction has 2637 states and 4862 transitions. [2022-01-28 14:16:49,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 8.32) internal successors, (208), 26 states have internal predecessors, (208), 0 states have call successors, (0), 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-01-28 14:16:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 4862 transitions. [2022-01-28 14:16:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-01-28 14:16:49,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:49,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:49,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-28 14:16:49,545 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:49,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1788617955, now seen corresponding path program 1 times [2022-01-28 14:16:49,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:49,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480169827] [2022-01-28 14:16:49,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:49,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:49,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:49,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480169827] [2022-01-28 14:16:49,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480169827] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:49,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:49,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-28 14:16:49,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186960992] [2022-01-28 14:16:49,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:49,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-28 14:16:49,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:49,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-28 14:16:49,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-01-28 14:16:49,959 INFO L87 Difference]: Start difference. First operand 2637 states and 4862 transitions. Second operand has 22 states, 21 states have (on average 9.904761904761905) internal successors, (208), 22 states have internal predecessors, (208), 0 states have call successors, (0), 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-01-28 14:16:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:51,399 INFO L93 Difference]: Finished difference Result 2636 states and 4854 transitions. [2022-01-28 14:16:51,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-28 14:16:51,399 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.904761904761905) internal successors, (208), 22 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2022-01-28 14:16:51,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:51,402 INFO L225 Difference]: With dead ends: 2636 [2022-01-28 14:16:51,403 INFO L226 Difference]: Without dead ends: 2636 [2022-01-28 14:16:51,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=344, Invalid=2106, Unknown=0, NotChecked=0, Total=2450 [2022-01-28 14:16:51,406 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 1224 mSDsluCounter, 3374 mSDsCounter, 0 mSdLazyCounter, 3499 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 3680 SdHoareTripleChecker+Invalid, 3572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 3499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:51,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1224 Valid, 3680 Invalid, 3572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 3499 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-28 14:16:51,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2022-01-28 14:16:51,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2572. [2022-01-28 14:16:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 2562 states have (on average 1.8481654957064793) internal successors, (4735), 2571 states have internal predecessors, (4735), 0 states have call successors, (0), 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-01-28 14:16:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 4735 transitions. [2022-01-28 14:16:51,427 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 4735 transitions. Word has length 208 [2022-01-28 14:16:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:51,427 INFO L470 AbstractCegarLoop]: Abstraction has 2572 states and 4735 transitions. [2022-01-28 14:16:51,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.904761904761905) internal successors, (208), 22 states have internal predecessors, (208), 0 states have call successors, (0), 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-01-28 14:16:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 4735 transitions. [2022-01-28 14:16:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-01-28 14:16:51,443 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:51,443 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:51,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-28 14:16:51,443 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:51,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:51,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1291090445, now seen corresponding path program 2 times [2022-01-28 14:16:51,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:51,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793237365] [2022-01-28 14:16:51,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:51,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 14:16:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 14:16:52,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 14:16:52,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793237365] [2022-01-28 14:16:52,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793237365] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 14:16:52,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 14:16:52,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-28 14:16:52,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957504542] [2022-01-28 14:16:52,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 14:16:52,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-28 14:16:52,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 14:16:52,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-28 14:16:52,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2022-01-28 14:16:52,030 INFO L87 Difference]: Start difference. First operand 2572 states and 4735 transitions. Second operand has 24 states, 23 states have (on average 9.043478260869565) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 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-01-28 14:16:53,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 14:16:53,352 INFO L93 Difference]: Finished difference Result 2560 states and 4712 transitions. [2022-01-28 14:16:53,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-28 14:16:53,352 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 9.043478260869565) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2022-01-28 14:16:53,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 14:16:53,355 INFO L225 Difference]: With dead ends: 2560 [2022-01-28 14:16:53,355 INFO L226 Difference]: Without dead ends: 2525 [2022-01-28 14:16:53,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=424, Invalid=1832, Unknown=0, NotChecked=0, Total=2256 [2022-01-28 14:16:53,358 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 1220 mSDsluCounter, 2356 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 699 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 2566 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 699 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-28 14:16:53,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1220 Valid, 2566 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [699 Valid, 1888 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-28 14:16:53,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2022-01-28 14:16:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2446. [2022-01-28 14:16:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2437 states have (on average 1.8453016003282725) internal successors, (4497), 2445 states have internal predecessors, (4497), 0 states have call successors, (0), 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-01-28 14:16:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 4497 transitions. [2022-01-28 14:16:53,397 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 4497 transitions. Word has length 208 [2022-01-28 14:16:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 14:16:53,400 INFO L470 AbstractCegarLoop]: Abstraction has 2446 states and 4497 transitions. [2022-01-28 14:16:53,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 9.043478260869565) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 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-01-28 14:16:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 4497 transitions. [2022-01-28 14:16:53,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-01-28 14:16:53,402 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 14:16:53,402 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 14:16:53,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-28 14:16:53,402 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-01-28 14:16:53,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 14:16:53,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1531443157, now seen corresponding path program 1 times [2022-01-28 14:16:53,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 14:16:53,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119181263] [2022-01-28 14:16:53,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 14:16:53,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 14:16:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-28 14:16:53,533 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-28 14:16:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-28 14:16:53,643 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-28 14:16:53,643 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-28 14:16:53,644 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (36 of 37 remaining) [2022-01-28 14:16:53,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2022-01-28 14:16:53,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2022-01-28 14:16:53,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2022-01-28 14:16:53,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2022-01-28 14:16:53,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2022-01-28 14:16:53,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2022-01-28 14:16:53,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2022-01-28 14:16:53,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2022-01-28 14:16:53,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2022-01-28 14:16:53,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2022-01-28 14:16:53,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2022-01-28 14:16:53,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2022-01-28 14:16:53,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2022-01-28 14:16:53,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2022-01-28 14:16:53,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2022-01-28 14:16:53,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2022-01-28 14:16:53,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2022-01-28 14:16:53,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2022-01-28 14:16:53,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2022-01-28 14:16:53,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (16 of 37 remaining) [2022-01-28 14:16:53,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2022-01-28 14:16:53,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2022-01-28 14:16:53,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2022-01-28 14:16:53,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2022-01-28 14:16:53,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2022-01-28 14:16:53,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2022-01-28 14:16:53,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2022-01-28 14:16:53,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2022-01-28 14:16:53,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2022-01-28 14:16:53,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2022-01-28 14:16:53,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2022-01-28 14:16:53,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2022-01-28 14:16:53,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2022-01-28 14:16:53,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2022-01-28 14:16:53,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2022-01-28 14:16:53,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2022-01-28 14:16:53,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-28 14:16:53,651 INFO L732 BasicCegarLoop]: Path program histogram: [9, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 14:16:53,655 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-28 14:16:53,655 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-28 14:16:53,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 02:16:53 BasicIcfg [2022-01-28 14:16:53,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-28 14:16:53,768 INFO L158 Benchmark]: Toolchain (without parser) took 46897.13ms. Allocated memory was 187.7MB in the beginning and 815.8MB in the end (delta: 628.1MB). Free memory was 129.7MB in the beginning and 680.9MB in the end (delta: -551.3MB). Peak memory consumption was 78.1MB. Max. memory is 8.0GB. [2022-01-28 14:16:53,768 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory was 148.9MB in the beginning and 148.8MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-28 14:16:53,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 620.05ms. Allocated memory was 187.7MB in the beginning and 247.5MB in the end (delta: 59.8MB). Free memory was 129.5MB in the beginning and 189.1MB in the end (delta: -59.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-28 14:16:53,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.63ms. Allocated memory is still 247.5MB. Free memory was 189.1MB in the beginning and 185.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-28 14:16:53,769 INFO L158 Benchmark]: Boogie Preprocessor took 43.09ms. Allocated memory is still 247.5MB. Free memory was 185.4MB in the beginning and 182.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-28 14:16:53,769 INFO L158 Benchmark]: RCFGBuilder took 578.46ms. Allocated memory is still 247.5MB. Free memory was 182.3MB in the beginning and 156.6MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-01-28 14:16:53,769 INFO L158 Benchmark]: TraceAbstraction took 45610.83ms. Allocated memory was 247.5MB in the beginning and 815.8MB in the end (delta: 568.3MB). Free memory was 156.1MB in the beginning and 680.9MB in the end (delta: -524.9MB). Peak memory consumption was 43.5MB. Max. memory is 8.0GB. [2022-01-28 14:16:53,769 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.10ms. Allocated memory is still 187.7MB. Free memory was 148.9MB in the beginning and 148.8MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 620.05ms. Allocated memory was 187.7MB in the beginning and 247.5MB in the end (delta: 59.8MB). Free memory was 129.5MB in the beginning and 189.1MB in the end (delta: -59.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.63ms. Allocated memory is still 247.5MB. Free memory was 189.1MB in the beginning and 185.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.09ms. Allocated memory is still 247.5MB. Free memory was 185.4MB in the beginning and 182.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 578.46ms. Allocated memory is still 247.5MB. Free memory was 182.3MB in the beginning and 156.6MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 45610.83ms. Allocated memory was 247.5MB in the beginning and 815.8MB in the end (delta: 568.3MB). Free memory was 156.1MB in the beginning and 680.9MB in the end (delta: -524.9MB). Peak memory consumption was 43.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 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; VAL [A={0:0}, B={0:0}] [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={3:0}, B={0:0}] [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}] [L1243] 0 pthread_t t1; VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, t1={13:0}] [L1244] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, malloc(sizeof(struct s))={-2:0}, p={-2:0}, t1={13:0}] [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [\old(x)=9, A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, p={-2:0}, x=9] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=9, A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, p={-2:0}, x=9] [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) VAL [A={-3:0}, A = malloc(sizeof(struct s))=108, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, malloc(sizeof(struct s))={-3:0}, p={-2:0}, t1={13:0}] [L1247] 0 init(A,3) VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [\old(x)=3, A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-3:0}, p={-3:0}, x=3] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=3, A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-3:0}, p={-3:0}, x=3] [L1247] RET 0 init(A,3) [L1248] EXPR 0 A->next VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1248] 0 A->next = p VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1249] 0 B = malloc(sizeof(struct s)) VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B = malloc(sizeof(struct s))=121, B_mutex={4:0}, malloc(sizeof(struct s))={11:0}, p={-2:0}, t1={13:0}] [L1250] 0 init(B,5) VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x VAL [\old(x)=5, A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={11:0}, p={11:0}, x=5] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=5, A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={11:0}, p={11:0}, x=5] [L1250] RET 0 init(B,5) [L1251] EXPR 0 B->next VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1251] 0 B->next = p VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1252] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={13:0}] [L1254] EXPR 0 A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1254] 0 p = A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1255] EXPR 0 p->datum VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1255] 0 printf("%d\n", p->datum) VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1258] EXPR 0 B->next VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1235] EXPR 1 A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1235] EXPR 1 A->next->datum VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1259] EXPR 0 p->datum VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=9, A->next->datum++=107, 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={-3:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=9, A->next->datum++=107, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2: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: p -> datum = x [1228] * C: B->next = p [1251] * C: B->next = p [1251] * C: B = malloc(sizeof(struct s)) [1249] * C: A->next = p [1248] * C: p -> next = ((void *)0) [1229] * C: p -> next = ((void *)0) [1229] * C: A->next = p [1248] * C: p -> datum = x [1228] * C: B->next = p [1251] * C: p -> next = ((void *)0) [1229] * C: A = malloc(sizeof(struct s)) [1246] * C: p -> next = ((void *)0) [1229] * C: p -> datum = x [1228] * C: A->next->datum++ [1235] * C: B->next = p [1251] * C: A->next = p [1248] * C: A->next = p [1248] * C: p -> datum = x [1228] 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: 45.4s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.1s, AutomataDifference: 32.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25588 SdHoareTripleChecker+Valid, 21.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25588 mSDsluCounter, 61536 SdHoareTripleChecker+Invalid, 18.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51859 mSDsCounter, 8107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47212 IncrementalHoareTripleChecker+Invalid, 55319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8107 mSolverCounterUnsat, 9797 mSDtfsCounter, 47212 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1186 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 939 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11015 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4286occurred in iteration=12, InterpolantAutomatonStates: 745, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 18343 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 5985 NumberOfCodeBlocks, 5985 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 5742 ConstructedInterpolants, 0 QuantifiedInterpolants, 63311 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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-01-28 14:16:53,901 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...