/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_17-arrayloop_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 18:25:47,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 18:25:47,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 18:25:47,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 18:25:47,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 18:25:47,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 18:25:47,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 18:25:47,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 18:25:47,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 18:25:47,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 18:25:47,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 18:25:47,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 18:25:47,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 18:25:47,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 18:25:47,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 18:25:47,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 18:25:47,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 18:25:47,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 18:25:47,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 18:25:47,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 18:25:47,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 18:25:47,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 18:25:47,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 18:25:47,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 18:25:47,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 18:25:47,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 18:25:47,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 18:25:47,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 18:25:47,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 18:25:47,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 18:25:47,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 18:25:47,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 18:25:47,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 18:25:47,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 18:25:47,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 18:25:47,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 18:25:47,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 18:25:47,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 18:25:47,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 18:25:47,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 18:25:47,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 18:25:47,931 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-03-03 18:25:47,949 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 18:25:47,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 18:25:47,949 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 18:25:47,949 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 18:25:47,950 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 18:25:47,950 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 18:25:47,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 18:25:47,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 18:25:47,951 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 18:25:47,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 18:25:47,951 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 18:25:47,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 18:25:47,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 18:25:47,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 18:25:47,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 18:25:47,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 18:25:47,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 18:25:47,952 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 18:25:47,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 18:25:47,952 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 18:25:47,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 18:25:47,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 18:25:47,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 18:25:47,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 18:25:47,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 18:25:47,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 18:25:47,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 18:25:47,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 18:25:47,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 18:25:47,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 18:25:47,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 18:25:47,954 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 18:25:47,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 18:25:47,954 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-03-03 18:25:48,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 18:25:48,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 18:25:48,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 18:25:48,189 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 18:25:48,190 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 18:25:48,191 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_17-arrayloop_nr.i [2022-03-03 18:25:48,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5327210e/6ee083322c7e4319aba82a080e1d559d/FLAG99695f15c [2022-03-03 18:25:48,796 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 18:25:48,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_17-arrayloop_nr.i [2022-03-03 18:25:48,819 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5327210e/6ee083322c7e4319aba82a080e1d559d/FLAG99695f15c [2022-03-03 18:25:49,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5327210e/6ee083322c7e4319aba82a080e1d559d [2022-03-03 18:25:49,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 18:25:49,255 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 18:25:49,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 18:25:49,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 18:25:49,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 18:25:49,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:25:49" (1/1) ... [2022-03-03 18:25:49,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c97fdc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:49, skipping insertion in model container [2022-03-03 18:25:49,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:25:49" (1/1) ... [2022-03-03 18:25:49,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 18:25:49,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 18:25:49,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 18:25:49,890 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 18:25:49,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 18:25:49,998 INFO L208 MainTranslator]: Completed translation [2022-03-03 18:25:49,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:49 WrapperNode [2022-03-03 18:25:50,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 18:25:50,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 18:25:50,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 18:25:50,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 18:25:50,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:49" (1/1) ... [2022-03-03 18:25:50,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:49" (1/1) ... [2022-03-03 18:25:50,086 INFO L137 Inliner]: procedures = 369, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 237 [2022-03-03 18:25:50,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 18:25:50,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 18:25:50,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 18:25:50,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 18:25:50,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:49" (1/1) ... [2022-03-03 18:25:50,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:49" (1/1) ... [2022-03-03 18:25:50,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:49" (1/1) ... [2022-03-03 18:25:50,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:49" (1/1) ... [2022-03-03 18:25:50,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:49" (1/1) ... [2022-03-03 18:25:50,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:49" (1/1) ... [2022-03-03 18:25:50,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:49" (1/1) ... [2022-03-03 18:25:50,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 18:25:50,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 18:25:50,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 18:25:50,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 18:25:50,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:49" (1/1) ... [2022-03-03 18:25:50,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 18:25:50,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:50,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-03 18:25:50,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-03 18:25:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 18:25:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-03 18:25:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 18:25:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 18:25:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 18:25:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-03 18:25:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-03 18:25:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 18:25:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-03 18:25:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-03 18:25:50,225 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-03 18:25:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 18:25:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 18:25:50,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 18:25:50,226 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 18:25:50,400 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 18:25:50,401 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 18:25:50,872 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 18:25:50,881 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 18:25:50,881 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-03 18:25:50,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 06:25:50 BoogieIcfgContainer [2022-03-03 18:25:50,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 18:25:50,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 18:25:50,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 18:25:50,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 18:25:50,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:25:49" (1/3) ... [2022-03-03 18:25:50,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224746e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:25:50, skipping insertion in model container [2022-03-03 18:25:50,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:49" (2/3) ... [2022-03-03 18:25:50,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224746e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:25:50, skipping insertion in model container [2022-03-03 18:25:50,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 06:25:50" (3/3) ... [2022-03-03 18:25:50,890 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2022-03-03 18:25:50,893 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 18:25:50,894 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 18:25:50,894 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-03-03 18:25:50,894 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 18:25:50,954 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,954 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,955 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,955 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,955 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,955 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,955 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,955 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,956 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,956 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,956 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,956 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,956 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,957 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,957 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,957 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,957 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,957 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,958 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,958 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,958 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,958 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,958 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,959 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,959 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,959 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,959 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,959 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,959 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,960 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,960 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,960 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,960 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,960 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,960 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,960 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,960 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,961 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,961 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,961 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,961 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,961 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,961 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,961 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,961 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,961 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,961 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,962 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,962 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,962 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,962 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,962 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,962 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,962 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,963 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,963 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,963 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,963 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,963 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,963 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,963 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,964 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,964 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,964 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,964 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,964 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,964 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,964 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,964 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,965 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,965 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,965 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,965 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,965 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,965 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,965 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,966 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,966 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,966 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,966 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,966 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,966 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,966 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,966 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,966 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,967 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,967 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,967 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,967 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,967 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,967 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,967 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,968 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,968 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,968 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,968 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,968 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,968 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,968 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,969 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,969 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,969 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,969 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,969 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,969 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,970 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,970 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,970 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,970 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,970 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,970 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,971 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,972 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,973 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,974 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,975 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,975 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,975 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,975 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,975 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,975 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,975 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,975 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,975 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,976 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,977 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,978 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,979 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,981 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,981 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,981 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,981 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,981 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,981 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,981 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,982 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,988 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,989 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,989 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,989 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,989 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,989 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,990 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,990 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,990 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,990 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,990 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,991 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,991 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,991 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:50,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,008 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,008 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,008 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,008 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,008 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,008 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,008 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,008 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,009 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,009 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,009 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,009 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,009 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,009 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,009 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,010 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,010 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,010 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,010 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,010 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,010 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,010 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,010 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,010 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,011 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,011 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,011 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,011 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,011 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,011 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,012 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,012 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,012 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,012 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,012 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,012 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,016 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,016 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,016 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,016 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,016 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,016 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,016 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,016 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,017 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,017 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,017 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,017 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,017 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,017 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,017 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,017 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,018 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,018 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,018 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,018 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,018 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,018 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,026 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,026 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,026 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,026 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,026 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,027 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,027 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,027 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,027 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,027 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,027 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,027 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,027 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,027 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:25:51,032 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-03 18:25:51,068 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 18:25:51,074 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 18:25:51,075 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-03-03 18:25:51,086 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 272 places, 274 transitions, 553 flow [2022-03-03 18:25:51,366 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9626 states, 9554 states have (on average 2.027527737073477) internal successors, (19371), 9625 states have internal predecessors, (19371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 9626 states, 9554 states have (on average 2.027527737073477) internal successors, (19371), 9625 states have internal predecessors, (19371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-03 18:25:51,400 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:51,400 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] [2022-03-03 18:25:51,401 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:51,406 INFO L85 PathProgramCache]: Analyzing trace with hash 121722460, now seen corresponding path program 1 times [2022-03-03 18:25:51,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:51,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625733176] [2022-03-03 18:25:51,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:51,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:51,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:51,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625733176] [2022-03-03 18:25:51,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625733176] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:51,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:51,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:25:51,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980547544] [2022-03-03 18:25:51,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:51,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:25:51,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:51,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:25:51,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:25:51,798 INFO L87 Difference]: Start difference. First operand has 9626 states, 9554 states have (on average 2.027527737073477) internal successors, (19371), 9625 states have internal predecessors, (19371), 0 states have call successors, (0), 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 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:52,554 INFO L93 Difference]: Finished difference Result 10027 states and 19985 transitions. [2022-03-03 18:25:52,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:25:52,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-03-03 18:25:52,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:52,640 INFO L225 Difference]: With dead ends: 10027 [2022-03-03 18:25:52,641 INFO L226 Difference]: Without dead ends: 10027 [2022-03-03 18:25:52,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:25:52,647 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 246 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:52,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 890 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-03 18:25:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10027 states. [2022-03-03 18:25:52,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10027 to 9946. [2022-03-03 18:25:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9946 states, 9875 states have (on average 2.007392405063291) internal successors, (19823), 9945 states have internal predecessors, (19823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9946 states to 9946 states and 19823 transitions. [2022-03-03 18:25:52,985 INFO L78 Accepts]: Start accepts. Automaton has 9946 states and 19823 transitions. Word has length 40 [2022-03-03 18:25:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:52,986 INFO L470 AbstractCegarLoop]: Abstraction has 9946 states and 19823 transitions. [2022-03-03 18:25:52,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:52,987 INFO L276 IsEmpty]: Start isEmpty. Operand 9946 states and 19823 transitions. [2022-03-03 18:25:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-03 18:25:52,994 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:52,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:52,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 18:25:52,996 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:52,999 INFO L85 PathProgramCache]: Analyzing trace with hash -964891731, now seen corresponding path program 1 times [2022-03-03 18:25:52,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:53,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178064718] [2022-03-03 18:25:53,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:53,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:53,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178064718] [2022-03-03 18:25:53,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178064718] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:53,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:53,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:25:53,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025642417] [2022-03-03 18:25:53,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:53,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:25:53,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:53,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:25:53,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:25:53,249 INFO L87 Difference]: Start difference. First operand 9946 states and 19823 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:53,801 INFO L93 Difference]: Finished difference Result 10347 states and 20626 transitions. [2022-03-03 18:25:53,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:25:53,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-03-03 18:25:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:53,845 INFO L225 Difference]: With dead ends: 10347 [2022-03-03 18:25:53,846 INFO L226 Difference]: Without dead ends: 10347 [2022-03-03 18:25:53,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:25:53,847 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 244 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:53,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 937 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-03 18:25:53,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10347 states. [2022-03-03 18:25:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 10266. [2022-03-03 18:25:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10266 states, 10196 states have (on average 2.0070615927814828) internal successors, (20464), 10265 states have internal predecessors, (20464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10266 states to 10266 states and 20464 transitions. [2022-03-03 18:25:54,167 INFO L78 Accepts]: Start accepts. Automaton has 10266 states and 20464 transitions. Word has length 48 [2022-03-03 18:25:54,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:54,168 INFO L470 AbstractCegarLoop]: Abstraction has 10266 states and 20464 transitions. [2022-03-03 18:25:54,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 10266 states and 20464 transitions. [2022-03-03 18:25:54,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-03 18:25:54,172 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:54,172 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:54,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 18:25:54,175 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:54,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:54,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1248115734, now seen corresponding path program 1 times [2022-03-03 18:25:54,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:54,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882494772] [2022-03-03 18:25:54,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:54,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:54,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:54,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882494772] [2022-03-03 18:25:54,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882494772] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:54,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:54,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-03 18:25:54,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643971131] [2022-03-03 18:25:54,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:54,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:25:54,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:54,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:25:54,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:25:54,244 INFO L87 Difference]: Start difference. First operand 10266 states and 20464 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:54,430 INFO L93 Difference]: Finished difference Result 19601 states and 39093 transitions. [2022-03-03 18:25:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:25:54,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-03 18:25:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:54,493 INFO L225 Difference]: With dead ends: 19601 [2022-03-03 18:25:54,493 INFO L226 Difference]: Without dead ends: 19601 [2022-03-03 18:25:54,494 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-03-03 18:25:54,497 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 226 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:54,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 552 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 18:25:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19601 states. [2022-03-03 18:25:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19601 to 10348. [2022-03-03 18:25:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10348 states, 10278 states have (on average 2.0070052539404553) internal successors, (20628), 10347 states have internal predecessors, (20628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 20628 transitions. [2022-03-03 18:25:54,852 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 20628 transitions. Word has length 49 [2022-03-03 18:25:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:54,853 INFO L470 AbstractCegarLoop]: Abstraction has 10348 states and 20628 transitions. [2022-03-03 18:25:54,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 20628 transitions. [2022-03-03 18:25:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-03 18:25:54,853 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:54,853 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] [2022-03-03 18:25:54,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 18:25:54,854 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:54,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:54,854 INFO L85 PathProgramCache]: Analyzing trace with hash -119349012, now seen corresponding path program 1 times [2022-03-03 18:25:54,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:54,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94488460] [2022-03-03 18:25:54,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:55,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:55,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94488460] [2022-03-03 18:25:55,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94488460] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:55,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:25:55,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:25:55,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503474350] [2022-03-03 18:25:55,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:55,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:25:55,111 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:55,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:25:55,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:25:55,111 INFO L87 Difference]: Start difference. First operand 10348 states and 20628 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:55,284 INFO L93 Difference]: Finished difference Result 10347 states and 20627 transitions. [2022-03-03 18:25:55,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:25:55,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-03-03 18:25:55,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:55,308 INFO L225 Difference]: With dead ends: 10347 [2022-03-03 18:25:55,309 INFO L226 Difference]: Without dead ends: 10347 [2022-03-03 18:25:55,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:25:55,310 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:55,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 398 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 18:25:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10347 states. [2022-03-03 18:25:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 10347. [2022-03-03 18:25:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10347 states, 10278 states have (on average 2.006907958746838) internal successors, (20627), 10346 states have internal predecessors, (20627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10347 states to 10347 states and 20627 transitions. [2022-03-03 18:25:55,524 INFO L78 Accepts]: Start accepts. Automaton has 10347 states and 20627 transitions. Word has length 59 [2022-03-03 18:25:55,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:55,525 INFO L470 AbstractCegarLoop]: Abstraction has 10347 states and 20627 transitions. [2022-03-03 18:25:55,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 10347 states and 20627 transitions. [2022-03-03 18:25:55,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-03-03 18:25:55,526 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:55,526 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] [2022-03-03 18:25:55,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 18:25:55,526 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:55,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:55,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1111224204, now seen corresponding path program 1 times [2022-03-03 18:25:55,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:55,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436924384] [2022-03-03 18:25:55,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:55,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:55,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:55,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436924384] [2022-03-03 18:25:55,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436924384] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:55,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747651745] [2022-03-03 18:25:55,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:55,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:55,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:55,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:25:55,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-03 18:25:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:55,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-03 18:25:55,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:25:55,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:55,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:25:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:56,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747651745] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:25:56,140 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:25:56,140 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-03 18:25:56,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650900670] [2022-03-03 18:25:56,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:25:56,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 18:25:56,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:56,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 18:25:56,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-03 18:25:56,141 INFO L87 Difference]: Start difference. First operand 10347 states and 20627 transitions. Second operand has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:56,386 INFO L93 Difference]: Finished difference Result 19642 states and 39134 transitions. [2022-03-03 18:25:56,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 18:25:56,386 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 0 states have call successors, (0), 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 90 [2022-03-03 18:25:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:56,429 INFO L225 Difference]: With dead ends: 19642 [2022-03-03 18:25:56,429 INFO L226 Difference]: Without dead ends: 19642 [2022-03-03 18:25:56,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-03 18:25:56,430 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 489 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:56,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 1614 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 18:25:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19642 states. [2022-03-03 18:25:56,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19642 to 10429. [2022-03-03 18:25:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10429 states, 10360 states have (on average 1.9989382239382238) internal successors, (20709), 10428 states have internal predecessors, (20709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10429 states to 10429 states and 20709 transitions. [2022-03-03 18:25:56,809 INFO L78 Accepts]: Start accepts. Automaton has 10429 states and 20709 transitions. Word has length 90 [2022-03-03 18:25:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:56,815 INFO L470 AbstractCegarLoop]: Abstraction has 10429 states and 20709 transitions. [2022-03-03 18:25:56,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 10429 states and 20709 transitions. [2022-03-03 18:25:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-03-03 18:25:56,818 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:56,818 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:56,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-03 18:25:57,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:57,041 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:57,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash -227998028, now seen corresponding path program 2 times [2022-03-03 18:25:57,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:57,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35914865] [2022-03-03 18:25:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:57,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:57,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:57,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35914865] [2022-03-03 18:25:57,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35914865] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:57,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593443332] [2022-03-03 18:25:57,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:25:57,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:57,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:57,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:25:57,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-03 18:25:57,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:25:57,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:25:57,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-03 18:25:57,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:25:57,749 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:25:57,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:57,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-03 18:25:57,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:57,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:57,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:57,812 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:25:57,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-03-03 18:25:57,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:57,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:57,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:57,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:57,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:57,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:25:57,860 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 18:25:57,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-03-03 18:25:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-03-03 18:25:57,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:25:57,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593443332] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:25:57,884 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:25:57,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2022-03-03 18:25:57,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566659750] [2022-03-03 18:25:57,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:25:57,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-03 18:25:57,885 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:25:57,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-03 18:25:57,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-03 18:25:57,885 INFO L87 Difference]: Start difference. First operand 10429 states and 20709 transitions. Second operand has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:25:58,791 INFO L93 Difference]: Finished difference Result 12090 states and 24032 transitions. [2022-03-03 18:25:58,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 18:25:58,792 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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 172 [2022-03-03 18:25:58,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:25:58,816 INFO L225 Difference]: With dead ends: 12090 [2022-03-03 18:25:58,816 INFO L226 Difference]: Without dead ends: 12090 [2022-03-03 18:25:58,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-03-03 18:25:58,818 INFO L933 BasicCegarLoop]: 726 mSDtfsCounter, 729 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:25:58,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 2448 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 18:25:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12090 states. [2022-03-03 18:25:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12090 to 10867. [2022-03-03 18:25:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10867 states, 10798 states have (on average 1.9989812928320059) internal successors, (21585), 10866 states have internal predecessors, (21585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10867 states to 10867 states and 21585 transitions. [2022-03-03 18:25:59,024 INFO L78 Accepts]: Start accepts. Automaton has 10867 states and 21585 transitions. Word has length 172 [2022-03-03 18:25:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:25:59,026 INFO L470 AbstractCegarLoop]: Abstraction has 10867 states and 21585 transitions. [2022-03-03 18:25:59,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:25:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 10867 states and 21585 transitions. [2022-03-03 18:25:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-03-03 18:25:59,031 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:25:59,031 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:25:59,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-03 18:25:59,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-03 18:25:59,255 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:25:59,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:25:59,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1836787897, now seen corresponding path program 1 times [2022-03-03 18:25:59,255 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:25:59,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292654459] [2022-03-03 18:25:59,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:59,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:25:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:25:59,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:25:59,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292654459] [2022-03-03 18:25:59,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292654459] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:25:59,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791692031] [2022-03-03 18:25:59,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:25:59,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:25:59,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:25:59,490 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:25:59,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-03 18:25:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:25:59,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-03 18:25:59,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:26:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:26:00,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:26:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:26:00,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791692031] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:26:00,453 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:26:00,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-03 18:26:00,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549677893] [2022-03-03 18:26:00,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:26:00,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-03 18:26:00,455 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:00,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-03 18:26:00,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:26:00,455 INFO L87 Difference]: Start difference. First operand 10867 states and 21585 transitions. Second operand has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:00,847 INFO L93 Difference]: Finished difference Result 20585 states and 40856 transitions. [2022-03-03 18:26:00,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 18:26:00,847 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 0 states have call successors, (0), 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 180 [2022-03-03 18:26:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:00,903 INFO L225 Difference]: With dead ends: 20585 [2022-03-03 18:26:00,903 INFO L226 Difference]: Without dead ends: 20585 [2022-03-03 18:26:00,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-03-03 18:26:00,904 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 805 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2508 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:00,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [805 Valid, 2508 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 18:26:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20585 states. [2022-03-03 18:26:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20585 to 11031. [2022-03-03 18:26:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11031 states, 10962 states have (on average 1.9840357598978289) internal successors, (21749), 11030 states have internal predecessors, (21749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11031 states to 11031 states and 21749 transitions. [2022-03-03 18:26:01,222 INFO L78 Accepts]: Start accepts. Automaton has 11031 states and 21749 transitions. Word has length 180 [2022-03-03 18:26:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:01,223 INFO L470 AbstractCegarLoop]: Abstraction has 11031 states and 21749 transitions. [2022-03-03 18:26:01,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:01,223 INFO L276 IsEmpty]: Start isEmpty. Operand 11031 states and 21749 transitions. [2022-03-03 18:26:01,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2022-03-03 18:26:01,279 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:01,280 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:01,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-03 18:26:01,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:26:01,480 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:01,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:01,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1455200967, now seen corresponding path program 2 times [2022-03-03 18:26:01,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:01,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840760729] [2022-03-03 18:26:01,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:01,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:01,890 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:26:01,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:01,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840760729] [2022-03-03 18:26:01,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840760729] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:26:01,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221139595] [2022-03-03 18:26:01,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:26:01,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:26:01,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:26:01,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:26:01,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-03 18:26:02,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:26:02,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:26:02,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-03 18:26:02,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:26:02,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-03 18:26:02,552 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-03 18:26:02,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-03-03 18:26:02,587 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-03 18:26:02,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-03-03 18:26:02,637 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-03 18:26:02,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-03-03 18:26:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2022-03-03 18:26:02,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:26:02,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221139595] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:02,660 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:26:02,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2022-03-03 18:26:02,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645971503] [2022-03-03 18:26:02,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:02,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:26:02,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:02,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:26:02,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:02,661 INFO L87 Difference]: Start difference. First operand 11031 states and 21749 transitions. Second operand has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:03,257 INFO L93 Difference]: Finished difference Result 11586 states and 22859 transitions. [2022-03-03 18:26:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:26:03,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 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 344 [2022-03-03 18:26:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:03,282 INFO L225 Difference]: With dead ends: 11586 [2022-03-03 18:26:03,282 INFO L226 Difference]: Without dead ends: 11586 [2022-03-03 18:26:03,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:03,283 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 314 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:03,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 1050 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-03 18:26:03,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11586 states. [2022-03-03 18:26:03,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11586 to 11469. [2022-03-03 18:26:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11469 states, 11400 states have (on average 1.9846491228070176) internal successors, (22625), 11468 states have internal predecessors, (22625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11469 states to 11469 states and 22625 transitions. [2022-03-03 18:26:03,572 INFO L78 Accepts]: Start accepts. Automaton has 11469 states and 22625 transitions. Word has length 344 [2022-03-03 18:26:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:03,572 INFO L470 AbstractCegarLoop]: Abstraction has 11469 states and 22625 transitions. [2022-03-03 18:26:03,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:03,573 INFO L276 IsEmpty]: Start isEmpty. Operand 11469 states and 22625 transitions. [2022-03-03 18:26:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-03-03 18:26:03,581 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:03,581 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:03,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-03 18:26:03,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:26:03,795 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash -368948921, now seen corresponding path program 1 times [2022-03-03 18:26:03,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:03,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028174172] [2022-03-03 18:26:03,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:03,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:26:04,127 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:04,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028174172] [2022-03-03 18:26:04,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028174172] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:26:04,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326656627] [2022-03-03 18:26:04,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:04,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:26:04,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:26:04,129 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:26:04,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-03 18:26:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:04,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-03 18:26:04,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:26:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:26:05,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:26:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 18:26:05,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326656627] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:26:05,835 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:26:05,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-03 18:26:05,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852222006] [2022-03-03 18:26:05,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:26:05,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-03 18:26:05,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:05,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-03 18:26:05,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:26:05,837 INFO L87 Difference]: Start difference. First operand 11469 states and 22625 transitions. Second operand has 23 states, 23 states have (on average 20.782608695652176) internal successors, (478), 23 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:06,373 INFO L93 Difference]: Finished difference Result 21487 states and 42537 transitions. [2022-03-03 18:26:06,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-03 18:26:06,374 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 20.782608695652176) internal successors, (478), 23 states have internal predecessors, (478), 0 states have call successors, (0), 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 353 [2022-03-03 18:26:06,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:06,416 INFO L225 Difference]: With dead ends: 21487 [2022-03-03 18:26:06,416 INFO L226 Difference]: Without dead ends: 21487 [2022-03-03 18:26:06,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 699 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-03-03 18:26:06,417 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 1141 mSDsluCounter, 3173 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:06,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1141 Valid, 3483 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 18:26:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21487 states. [2022-03-03 18:26:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21487 to 11592. [2022-03-03 18:26:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11592 states, 11523 states have (on average 1.9741386791634123) internal successors, (22748), 11591 states have internal predecessors, (22748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11592 states to 11592 states and 22748 transitions. [2022-03-03 18:26:06,757 INFO L78 Accepts]: Start accepts. Automaton has 11592 states and 22748 transitions. Word has length 353 [2022-03-03 18:26:06,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:06,758 INFO L470 AbstractCegarLoop]: Abstraction has 11592 states and 22748 transitions. [2022-03-03 18:26:06,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 20.782608695652176) internal successors, (478), 23 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 11592 states and 22748 transitions. [2022-03-03 18:26:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:06,766 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:06,766 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:06,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-03 18:26:06,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:26:06,980 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:06,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:06,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1637359643, now seen corresponding path program 2 times [2022-03-03 18:26:06,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:06,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798625931] [2022-03-03 18:26:06,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:06,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:07,402 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:07,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798625931] [2022-03-03 18:26:07,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798625931] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:07,402 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:07,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:07,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692043924] [2022-03-03 18:26:07,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:07,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:07,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:07,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:07,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:07,403 INFO L87 Difference]: Start difference. First operand 11592 states and 22748 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:08,811 INFO L93 Difference]: Finished difference Result 11725 states and 23014 transitions. [2022-03-03 18:26:08,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:26:08,812 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:08,834 INFO L225 Difference]: With dead ends: 11725 [2022-03-03 18:26:08,835 INFO L226 Difference]: Without dead ends: 11725 [2022-03-03 18:26:08,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-03-03 18:26:08,836 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 636 mSDsluCounter, 2342 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 2930 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:08,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 2930 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:26:08,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11725 states. [2022-03-03 18:26:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11725 to 11609. [2022-03-03 18:26:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11609 states, 11540 states have (on average 1.9741767764298093) internal successors, (22782), 11608 states have internal predecessors, (22782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11609 states to 11609 states and 22782 transitions. [2022-03-03 18:26:09,135 INFO L78 Accepts]: Start accepts. Automaton has 11609 states and 22782 transitions. Word has length 476 [2022-03-03 18:26:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:09,136 INFO L470 AbstractCegarLoop]: Abstraction has 11609 states and 22782 transitions. [2022-03-03 18:26:09,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 11609 states and 22782 transitions. [2022-03-03 18:26:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:09,141 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:09,142 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:09,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-03 18:26:09,142 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:09,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:09,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1557491129, now seen corresponding path program 3 times [2022-03-03 18:26:09,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:09,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192427868] [2022-03-03 18:26:09,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:09,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:09,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:09,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192427868] [2022-03-03 18:26:09,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192427868] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:09,587 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:09,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:09,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739249595] [2022-03-03 18:26:09,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:09,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:09,588 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:09,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:09,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:09,589 INFO L87 Difference]: Start difference. First operand 11609 states and 22782 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:10,942 INFO L93 Difference]: Finished difference Result 11752 states and 23068 transitions. [2022-03-03 18:26:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-03 18:26:10,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:10,968 INFO L225 Difference]: With dead ends: 11752 [2022-03-03 18:26:10,968 INFO L226 Difference]: Without dead ends: 11752 [2022-03-03 18:26:10,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-03-03 18:26:10,969 INFO L933 BasicCegarLoop]: 591 mSDtfsCounter, 566 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 2927 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:10,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 2927 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:26:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11752 states. [2022-03-03 18:26:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11752 to 11610. [2022-03-03 18:26:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11610 states, 11541 states have (on average 1.9741790139502642) internal successors, (22784), 11609 states have internal predecessors, (22784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11610 states to 11610 states and 22784 transitions. [2022-03-03 18:26:11,190 INFO L78 Accepts]: Start accepts. Automaton has 11610 states and 22784 transitions. Word has length 476 [2022-03-03 18:26:11,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:11,191 INFO L470 AbstractCegarLoop]: Abstraction has 11610 states and 22784 transitions. [2022-03-03 18:26:11,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 11610 states and 22784 transitions. [2022-03-03 18:26:11,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:11,197 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:11,197 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:11,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-03 18:26:11,197 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash 988805515, now seen corresponding path program 4 times [2022-03-03 18:26:11,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:11,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350492557] [2022-03-03 18:26:11,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:11,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:11,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:11,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350492557] [2022-03-03 18:26:11,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350492557] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:11,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:11,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:11,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677855571] [2022-03-03 18:26:11,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:11,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:11,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:11,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:11,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:11,604 INFO L87 Difference]: Start difference. First operand 11610 states and 22784 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:13,137 INFO L93 Difference]: Finished difference Result 11790 states and 23144 transitions. [2022-03-03 18:26:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:26:13,137 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:13,160 INFO L225 Difference]: With dead ends: 11790 [2022-03-03 18:26:13,160 INFO L226 Difference]: Without dead ends: 11790 [2022-03-03 18:26:13,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:26:13,161 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 590 mSDsluCounter, 2890 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 3473 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:13,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 3473 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2719 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 18:26:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11790 states. [2022-03-03 18:26:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 11633. [2022-03-03 18:26:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11633 states, 11564 states have (on average 1.9743168453822206) internal successors, (22831), 11632 states have internal predecessors, (22831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 22831 transitions. [2022-03-03 18:26:13,358 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 22831 transitions. Word has length 476 [2022-03-03 18:26:13,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:13,359 INFO L470 AbstractCegarLoop]: Abstraction has 11633 states and 22831 transitions. [2022-03-03 18:26:13,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 22831 transitions. [2022-03-03 18:26:13,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:13,363 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:13,364 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:13,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-03 18:26:13,364 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:13,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:13,364 INFO L85 PathProgramCache]: Analyzing trace with hash 695892193, now seen corresponding path program 5 times [2022-03-03 18:26:13,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:13,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215339496] [2022-03-03 18:26:13,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:13,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:13,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215339496] [2022-03-03 18:26:13,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215339496] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:13,753 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:13,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:13,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738849675] [2022-03-03 18:26:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:13,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:13,754 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:13,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:13,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:13,755 INFO L87 Difference]: Start difference. First operand 11633 states and 22831 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:14,824 INFO L93 Difference]: Finished difference Result 11790 states and 23144 transitions. [2022-03-03 18:26:14,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-03 18:26:14,824 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:14,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:14,846 INFO L225 Difference]: With dead ends: 11790 [2022-03-03 18:26:14,846 INFO L226 Difference]: Without dead ends: 11790 [2022-03-03 18:26:14,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:26:14,847 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 505 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:14,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 2610 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:26:14,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11790 states. [2022-03-03 18:26:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 11635. [2022-03-03 18:26:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11635 states, 11566 states have (on average 1.974321286529483) internal successors, (22835), 11634 states have internal predecessors, (22835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11635 states to 11635 states and 22835 transitions. [2022-03-03 18:26:15,039 INFO L78 Accepts]: Start accepts. Automaton has 11635 states and 22835 transitions. Word has length 476 [2022-03-03 18:26:15,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:15,040 INFO L470 AbstractCegarLoop]: Abstraction has 11635 states and 22835 transitions. [2022-03-03 18:26:15,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 11635 states and 22835 transitions. [2022-03-03 18:26:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:15,044 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:15,045 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:15,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-03 18:26:15,045 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:15,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:15,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1052778459, now seen corresponding path program 6 times [2022-03-03 18:26:15,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:15,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963015976] [2022-03-03 18:26:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:15,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:15,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:15,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963015976] [2022-03-03 18:26:15,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963015976] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:15,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:15,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:15,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71101839] [2022-03-03 18:26:15,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:15,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:15,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:15,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:15,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:15,409 INFO L87 Difference]: Start difference. First operand 11635 states and 22835 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:16,755 INFO L93 Difference]: Finished difference Result 11854 states and 23272 transitions. [2022-03-03 18:26:16,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:26:16,756 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:16,775 INFO L225 Difference]: With dead ends: 11854 [2022-03-03 18:26:16,775 INFO L226 Difference]: Without dead ends: 11854 [2022-03-03 18:26:16,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-03 18:26:16,776 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 523 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:16,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 3135 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:26:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2022-03-03 18:26:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 11634. [2022-03-03 18:26:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11634 states, 11565 states have (on average 1.97431906614786) internal successors, (22833), 11633 states have internal predecessors, (22833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11634 states to 11634 states and 22833 transitions. [2022-03-03 18:26:16,962 INFO L78 Accepts]: Start accepts. Automaton has 11634 states and 22833 transitions. Word has length 476 [2022-03-03 18:26:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:16,962 INFO L470 AbstractCegarLoop]: Abstraction has 11634 states and 22833 transitions. [2022-03-03 18:26:16,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:16,963 INFO L276 IsEmpty]: Start isEmpty. Operand 11634 states and 22833 transitions. [2022-03-03 18:26:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:16,967 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:16,967 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:16,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-03 18:26:16,967 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:16,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1137607131, now seen corresponding path program 7 times [2022-03-03 18:26:16,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:16,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567847772] [2022-03-03 18:26:16,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:16,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:17,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:17,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567847772] [2022-03-03 18:26:17,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567847772] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:17,306 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:17,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:17,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865075957] [2022-03-03 18:26:17,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:17,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:17,307 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:17,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:17,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:17,308 INFO L87 Difference]: Start difference. First operand 11634 states and 22833 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:18,463 INFO L93 Difference]: Finished difference Result 11855 states and 23274 transitions. [2022-03-03 18:26:18,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:26:18,465 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:18,477 INFO L225 Difference]: With dead ends: 11855 [2022-03-03 18:26:18,477 INFO L226 Difference]: Without dead ends: 11855 [2022-03-03 18:26:18,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:18,478 INFO L933 BasicCegarLoop]: 549 mSDtfsCounter, 548 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:18,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 2649 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:26:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2022-03-03 18:26:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 11657. [2022-03-03 18:26:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11657 states, 11588 states have (on average 1.9744563341387642) internal successors, (22880), 11656 states have internal predecessors, (22880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11657 states to 11657 states and 22880 transitions. [2022-03-03 18:26:18,632 INFO L78 Accepts]: Start accepts. Automaton has 11657 states and 22880 transitions. Word has length 476 [2022-03-03 18:26:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:18,632 INFO L470 AbstractCegarLoop]: Abstraction has 11657 states and 22880 transitions. [2022-03-03 18:26:18,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 11657 states and 22880 transitions. [2022-03-03 18:26:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:18,637 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:18,637 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:18,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-03 18:26:18,637 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1627233295, now seen corresponding path program 8 times [2022-03-03 18:26:18,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:18,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171210816] [2022-03-03 18:26:18,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:18,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:19,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:19,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171210816] [2022-03-03 18:26:19,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171210816] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:19,027 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:19,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:26:19,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575487492] [2022-03-03 18:26:19,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:19,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:26:19,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:19,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:26:19,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:26:19,028 INFO L87 Difference]: Start difference. First operand 11657 states and 22880 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:20,143 INFO L93 Difference]: Finished difference Result 11923 states and 23410 transitions. [2022-03-03 18:26:20,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-03 18:26:20,148 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:20,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:20,163 INFO L225 Difference]: With dead ends: 11923 [2022-03-03 18:26:20,163 INFO L226 Difference]: Without dead ends: 11923 [2022-03-03 18:26:20,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2022-03-03 18:26:20,164 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 950 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:20,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 2658 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:26:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11923 states. [2022-03-03 18:26:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11923 to 11681. [2022-03-03 18:26:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11681 states, 11612 states have (on average 1.9745952462969343) internal successors, (22929), 11680 states have internal predecessors, (22929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 22929 transitions. [2022-03-03 18:26:20,299 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 22929 transitions. Word has length 476 [2022-03-03 18:26:20,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:20,299 INFO L470 AbstractCegarLoop]: Abstraction has 11681 states and 22929 transitions. [2022-03-03 18:26:20,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 22929 transitions. [2022-03-03 18:26:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:20,303 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:20,303 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:20,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-03 18:26:20,303 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:20,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:20,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1984499955, now seen corresponding path program 9 times [2022-03-03 18:26:20,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:20,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177146016] [2022-03-03 18:26:20,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:20,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:20,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:20,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177146016] [2022-03-03 18:26:20,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177146016] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:20,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:20,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:26:20,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705108453] [2022-03-03 18:26:20,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:20,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:26:20,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:20,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:26:20,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:26:20,635 INFO L87 Difference]: Start difference. First operand 11681 states and 22929 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:21,871 INFO L93 Difference]: Finished difference Result 12163 states and 23890 transitions. [2022-03-03 18:26:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-03 18:26:21,872 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:21,887 INFO L225 Difference]: With dead ends: 12163 [2022-03-03 18:26:21,887 INFO L226 Difference]: Without dead ends: 12163 [2022-03-03 18:26:21,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2022-03-03 18:26:21,888 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 1055 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 3332 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:21,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1055 Valid, 3332 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:26:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12163 states. [2022-03-03 18:26:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12163 to 11685. [2022-03-03 18:26:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11685 states, 11616 states have (on average 1.9746039944903582) internal successors, (22937), 11684 states have internal predecessors, (22937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11685 states to 11685 states and 22937 transitions. [2022-03-03 18:26:22,028 INFO L78 Accepts]: Start accepts. Automaton has 11685 states and 22937 transitions. Word has length 476 [2022-03-03 18:26:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:22,028 INFO L470 AbstractCegarLoop]: Abstraction has 11685 states and 22937 transitions. [2022-03-03 18:26:22,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 11685 states and 22937 transitions. [2022-03-03 18:26:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:22,032 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:22,032 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:22,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-03 18:26:22,032 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:22,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1263639721, now seen corresponding path program 10 times [2022-03-03 18:26:22,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:22,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58453278] [2022-03-03 18:26:22,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:22,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:22,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:22,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58453278] [2022-03-03 18:26:22,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58453278] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:22,387 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:22,387 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:26:22,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439436482] [2022-03-03 18:26:22,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:22,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:26:22,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:22,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:26:22,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:26:22,388 INFO L87 Difference]: Start difference. First operand 11685 states and 22937 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:23,861 INFO L93 Difference]: Finished difference Result 21888 states and 43344 transitions. [2022-03-03 18:26:23,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:26:23,862 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:23,893 INFO L225 Difference]: With dead ends: 21888 [2022-03-03 18:26:23,893 INFO L226 Difference]: Without dead ends: 21888 [2022-03-03 18:26:23,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=348, Invalid=1058, Unknown=0, NotChecked=0, Total=1406 [2022-03-03 18:26:23,895 INFO L933 BasicCegarLoop]: 795 mSDtfsCounter, 1716 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 4143 SdHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:23,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1716 Valid, 4143 Invalid, 2252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 18:26:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21888 states. [2022-03-03 18:26:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21888 to 11752. [2022-03-03 18:26:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11752 states, 11683 states have (on average 1.974835230677052) internal successors, (23072), 11751 states have internal predecessors, (23072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11752 states to 11752 states and 23072 transitions. [2022-03-03 18:26:24,087 INFO L78 Accepts]: Start accepts. Automaton has 11752 states and 23072 transitions. Word has length 476 [2022-03-03 18:26:24,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:24,087 INFO L470 AbstractCegarLoop]: Abstraction has 11752 states and 23072 transitions. [2022-03-03 18:26:24,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:24,088 INFO L276 IsEmpty]: Start isEmpty. Operand 11752 states and 23072 transitions. [2022-03-03 18:26:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:24,092 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:24,092 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:24,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-03 18:26:24,092 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:24,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:24,093 INFO L85 PathProgramCache]: Analyzing trace with hash -142092517, now seen corresponding path program 1 times [2022-03-03 18:26:24,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:24,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189070483] [2022-03-03 18:26:24,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:24,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:24,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189070483] [2022-03-03 18:26:24,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189070483] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:24,377 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:24,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:24,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242991513] [2022-03-03 18:26:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:24,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:24,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:24,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:24,379 INFO L87 Difference]: Start difference. First operand 11752 states and 23072 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:26,197 INFO L93 Difference]: Finished difference Result 21740 states and 43045 transitions. [2022-03-03 18:26:26,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-03 18:26:26,199 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:26,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:26,231 INFO L225 Difference]: With dead ends: 21740 [2022-03-03 18:26:26,231 INFO L226 Difference]: Without dead ends: 21740 [2022-03-03 18:26:26,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=368, Invalid=1354, Unknown=0, NotChecked=0, Total=1722 [2022-03-03 18:26:26,232 INFO L933 BasicCegarLoop]: 803 mSDtfsCounter, 1507 mSDsluCounter, 3714 mSDsCounter, 0 mSdLazyCounter, 3080 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 4516 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:26,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1507 Valid, 4516 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3080 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 18:26:26,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21740 states. [2022-03-03 18:26:26,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21740 to 11831. [2022-03-03 18:26:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11831 states, 11762 states have (on average 1.9750042509777248) internal successors, (23230), 11830 states have internal predecessors, (23230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11831 states to 11831 states and 23230 transitions. [2022-03-03 18:26:26,444 INFO L78 Accepts]: Start accepts. Automaton has 11831 states and 23230 transitions. Word has length 476 [2022-03-03 18:26:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:26,444 INFO L470 AbstractCegarLoop]: Abstraction has 11831 states and 23230 transitions. [2022-03-03 18:26:26,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 11831 states and 23230 transitions. [2022-03-03 18:26:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:26,447 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:26,447 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:26,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-03 18:26:26,451 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash 821726293, now seen corresponding path program 2 times [2022-03-03 18:26:26,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:26,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866539001] [2022-03-03 18:26:26,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:26,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:26,797 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:26,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866539001] [2022-03-03 18:26:26,797 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866539001] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:26,797 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:26,797 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:26,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176661099] [2022-03-03 18:26:26,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:26,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:26,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:26,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:26,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:26,800 INFO L87 Difference]: Start difference. First operand 11831 states and 23230 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:27,510 INFO L93 Difference]: Finished difference Result 12198 states and 23964 transitions. [2022-03-03 18:26:27,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:26:27,511 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:27,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:27,527 INFO L225 Difference]: With dead ends: 12198 [2022-03-03 18:26:27,527 INFO L226 Difference]: Without dead ends: 12198 [2022-03-03 18:26:27,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:27,528 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 333 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:27,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 2224 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:26:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12198 states. [2022-03-03 18:26:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12198 to 11856. [2022-03-03 18:26:27,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11856 states, 11787 states have (on average 1.9750572664800203) internal successors, (23280), 11855 states have internal predecessors, (23280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11856 states to 11856 states and 23280 transitions. [2022-03-03 18:26:27,672 INFO L78 Accepts]: Start accepts. Automaton has 11856 states and 23280 transitions. Word has length 476 [2022-03-03 18:26:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:27,672 INFO L470 AbstractCegarLoop]: Abstraction has 11856 states and 23280 transitions. [2022-03-03 18:26:27,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 11856 states and 23280 transitions. [2022-03-03 18:26:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:27,675 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:27,675 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:27,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-03 18:26:27,675 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:27,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:27,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2028045517, now seen corresponding path program 3 times [2022-03-03 18:26:27,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:27,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474661613] [2022-03-03 18:26:27,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:27,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:27,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:27,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474661613] [2022-03-03 18:26:27,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474661613] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:27,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:27,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:27,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679384469] [2022-03-03 18:26:27,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:27,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:27,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:27,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:27,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:27,992 INFO L87 Difference]: Start difference. First operand 11856 states and 23280 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:28,844 INFO L93 Difference]: Finished difference Result 12278 states and 24124 transitions. [2022-03-03 18:26:28,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:26:28,844 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:28,861 INFO L225 Difference]: With dead ends: 12278 [2022-03-03 18:26:28,861 INFO L226 Difference]: Without dead ends: 12278 [2022-03-03 18:26:28,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:28,862 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 358 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:28,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 2542 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:26:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12278 states. [2022-03-03 18:26:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12278 to 11864. [2022-03-03 18:26:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11864 states, 11795 states have (on average 1.975074183976261) internal successors, (23296), 11863 states have internal predecessors, (23296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11864 states to 11864 states and 23296 transitions. [2022-03-03 18:26:29,002 INFO L78 Accepts]: Start accepts. Automaton has 11864 states and 23296 transitions. Word has length 476 [2022-03-03 18:26:29,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:29,002 INFO L470 AbstractCegarLoop]: Abstraction has 11864 states and 23296 transitions. [2022-03-03 18:26:29,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:29,003 INFO L276 IsEmpty]: Start isEmpty. Operand 11864 states and 23296 transitions. [2022-03-03 18:26:29,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:29,006 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:29,007 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:29,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-03 18:26:29,007 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:29,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:29,007 INFO L85 PathProgramCache]: Analyzing trace with hash 568044087, now seen corresponding path program 4 times [2022-03-03 18:26:29,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:29,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115843324] [2022-03-03 18:26:29,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:29,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:29,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:29,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115843324] [2022-03-03 18:26:29,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115843324] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:29,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:29,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:29,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418186582] [2022-03-03 18:26:29,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:29,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:29,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:29,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:29,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:29,301 INFO L87 Difference]: Start difference. First operand 11864 states and 23296 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:30,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:30,129 INFO L93 Difference]: Finished difference Result 12342 states and 24252 transitions. [2022-03-03 18:26:30,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:26:30,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:30,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:30,150 INFO L225 Difference]: With dead ends: 12342 [2022-03-03 18:26:30,151 INFO L226 Difference]: Without dead ends: 12342 [2022-03-03 18:26:30,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:30,152 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 372 mSDsluCounter, 2128 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:30,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 2554 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:26:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12342 states. [2022-03-03 18:26:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12342 to 11872. [2022-03-03 18:26:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11872 states, 11803 states have (on average 1.9750910785393545) internal successors, (23312), 11871 states have internal predecessors, (23312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11872 states to 11872 states and 23312 transitions. [2022-03-03 18:26:30,352 INFO L78 Accepts]: Start accepts. Automaton has 11872 states and 23312 transitions. Word has length 476 [2022-03-03 18:26:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:30,352 INFO L470 AbstractCegarLoop]: Abstraction has 11872 states and 23312 transitions. [2022-03-03 18:26:30,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 11872 states and 23312 transitions. [2022-03-03 18:26:30,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:30,355 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:30,356 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:30,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-03 18:26:30,356 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:30,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:30,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1053384145, now seen corresponding path program 5 times [2022-03-03 18:26:30,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:30,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950489343] [2022-03-03 18:26:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:30,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:30,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:30,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950489343] [2022-03-03 18:26:30,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950489343] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:30,655 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:30,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:30,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409642021] [2022-03-03 18:26:30,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:30,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:30,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:30,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:30,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:30,656 INFO L87 Difference]: Start difference. First operand 11872 states and 23312 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:32,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:32,007 INFO L93 Difference]: Finished difference Result 22094 states and 43756 transitions. [2022-03-03 18:26:32,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:26:32,007 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:32,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:32,037 INFO L225 Difference]: With dead ends: 22094 [2022-03-03 18:26:32,038 INFO L226 Difference]: Without dead ends: 22094 [2022-03-03 18:26:32,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-03-03 18:26:32,038 INFO L933 BasicCegarLoop]: 716 mSDtfsCounter, 914 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 3873 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:32,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [914 Valid, 3873 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:26:32,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22094 states. [2022-03-03 18:26:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22094 to 11904. [2022-03-03 18:26:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11904 states, 11835 states have (on average 1.9751584283903676) internal successors, (23376), 11903 states have internal predecessors, (23376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11904 states to 11904 states and 23376 transitions. [2022-03-03 18:26:32,233 INFO L78 Accepts]: Start accepts. Automaton has 11904 states and 23376 transitions. Word has length 476 [2022-03-03 18:26:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:32,234 INFO L470 AbstractCegarLoop]: Abstraction has 11904 states and 23376 transitions. [2022-03-03 18:26:32,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 11904 states and 23376 transitions. [2022-03-03 18:26:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:32,237 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:32,237 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:32,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-03 18:26:32,237 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:32,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1555409893, now seen corresponding path program 11 times [2022-03-03 18:26:32,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:32,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337104609] [2022-03-03 18:26:32,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:32,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:32,556 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:32,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337104609] [2022-03-03 18:26:32,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337104609] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:32,556 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:32,557 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:26:32,557 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001468678] [2022-03-03 18:26:32,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:32,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:26:32,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:32,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:26:32,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:26:32,558 INFO L87 Difference]: Start difference. First operand 11904 states and 23376 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:34,057 INFO L93 Difference]: Finished difference Result 21883 states and 43334 transitions. [2022-03-03 18:26:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-03 18:26:34,057 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:34,088 INFO L225 Difference]: With dead ends: 21883 [2022-03-03 18:26:34,088 INFO L226 Difference]: Without dead ends: 21883 [2022-03-03 18:26:34,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2022-03-03 18:26:34,089 INFO L933 BasicCegarLoop]: 830 mSDtfsCounter, 1085 mSDsluCounter, 3988 mSDsCounter, 0 mSdLazyCounter, 2878 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 4816 SdHoareTripleChecker+Invalid, 2948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:34,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1085 Valid, 4816 Invalid, 2948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2878 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:26:34,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21883 states. [2022-03-03 18:26:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21883 to 11847. [2022-03-03 18:26:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11778 states have (on average 1.9750382068262864) internal successors, (23262), 11846 states have internal predecessors, (23262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 23262 transitions. [2022-03-03 18:26:34,356 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 23262 transitions. Word has length 476 [2022-03-03 18:26:34,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:34,356 INFO L470 AbstractCegarLoop]: Abstraction has 11847 states and 23262 transitions. [2022-03-03 18:26:34,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 23262 transitions. [2022-03-03 18:26:34,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:34,359 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:34,359 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:34,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-03 18:26:34,359 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:34,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:34,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1830588915, now seen corresponding path program 6 times [2022-03-03 18:26:34,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:34,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371676026] [2022-03-03 18:26:34,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:34,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:34,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:34,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371676026] [2022-03-03 18:26:34,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371676026] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:34,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:34,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:34,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313736731] [2022-03-03 18:26:34,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:34,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:34,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:34,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:34,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:34,654 INFO L87 Difference]: Start difference. First operand 11847 states and 23262 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:36,163 INFO L93 Difference]: Finished difference Result 22050 states and 43668 transitions. [2022-03-03 18:26:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:26:36,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:36,192 INFO L225 Difference]: With dead ends: 22050 [2022-03-03 18:26:36,192 INFO L226 Difference]: Without dead ends: 22050 [2022-03-03 18:26:36,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:36,193 INFO L933 BasicCegarLoop]: 812 mSDtfsCounter, 913 mSDsluCounter, 4025 mSDsCounter, 0 mSdLazyCounter, 2917 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 4836 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:36,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 4836 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2917 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:26:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22050 states. [2022-03-03 18:26:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22050 to 11919. [2022-03-03 18:26:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11919 states, 11850 states have (on average 1.9751898734177216) internal successors, (23406), 11918 states have internal predecessors, (23406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11919 states to 11919 states and 23406 transitions. [2022-03-03 18:26:36,379 INFO L78 Accepts]: Start accepts. Automaton has 11919 states and 23406 transitions. Word has length 476 [2022-03-03 18:26:36,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:36,380 INFO L470 AbstractCegarLoop]: Abstraction has 11919 states and 23406 transitions. [2022-03-03 18:26:36,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 11919 states and 23406 transitions. [2022-03-03 18:26:36,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:36,383 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:36,383 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:36,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-03 18:26:36,384 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:36,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:36,384 INFO L85 PathProgramCache]: Analyzing trace with hash -144415657, now seen corresponding path program 12 times [2022-03-03 18:26:36,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:36,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558173868] [2022-03-03 18:26:36,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:36,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:36,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:36,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558173868] [2022-03-03 18:26:36,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558173868] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:36,690 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:36,690 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:26:36,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909619179] [2022-03-03 18:26:36,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:36,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:26:36,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:36,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:26:36,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:26:36,691 INFO L87 Difference]: Start difference. First operand 11919 states and 23406 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:38,277 INFO L93 Difference]: Finished difference Result 21957 states and 43482 transitions. [2022-03-03 18:26:38,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-03 18:26:38,277 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:38,306 INFO L225 Difference]: With dead ends: 21957 [2022-03-03 18:26:38,307 INFO L226 Difference]: Without dead ends: 21957 [2022-03-03 18:26:38,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2022-03-03 18:26:38,307 INFO L933 BasicCegarLoop]: 929 mSDtfsCounter, 1137 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 3115 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 5469 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:38,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1137 Valid, 5469 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3115 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:26:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21957 states. [2022-03-03 18:26:38,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21957 to 11847. [2022-03-03 18:26:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11778 states have (on average 1.9750382068262864) internal successors, (23262), 11846 states have internal predecessors, (23262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 23262 transitions. [2022-03-03 18:26:38,556 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 23262 transitions. Word has length 476 [2022-03-03 18:26:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:38,556 INFO L470 AbstractCegarLoop]: Abstraction has 11847 states and 23262 transitions. [2022-03-03 18:26:38,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 23262 transitions. [2022-03-03 18:26:38,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:38,559 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:38,560 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:38,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-03 18:26:38,560 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:38,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1527151935, now seen corresponding path program 7 times [2022-03-03 18:26:38,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:38,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39244441] [2022-03-03 18:26:38,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:38,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:38,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:38,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39244441] [2022-03-03 18:26:38,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39244441] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:38,843 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:38,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:38,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394833366] [2022-03-03 18:26:38,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:38,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:38,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:38,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:38,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:38,844 INFO L87 Difference]: Start difference. First operand 11847 states and 23262 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:39,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:39,829 INFO L93 Difference]: Finished difference Result 13605 states and 26712 transitions. [2022-03-03 18:26:39,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:26:39,829 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:39,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:39,846 INFO L225 Difference]: With dead ends: 13605 [2022-03-03 18:26:39,846 INFO L226 Difference]: Without dead ends: 13605 [2022-03-03 18:26:39,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:39,847 INFO L933 BasicCegarLoop]: 611 mSDtfsCounter, 603 mSDsluCounter, 2226 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:39,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 2837 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1792 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 18:26:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13605 states. [2022-03-03 18:26:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13605 to 11867. [2022-03-03 18:26:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11867 states, 11798 states have (on average 1.9750805221223937) internal successors, (23302), 11866 states have internal predecessors, (23302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 23302 transitions. [2022-03-03 18:26:39,982 INFO L78 Accepts]: Start accepts. Automaton has 11867 states and 23302 transitions. Word has length 476 [2022-03-03 18:26:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:39,983 INFO L470 AbstractCegarLoop]: Abstraction has 11867 states and 23302 transitions. [2022-03-03 18:26:39,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 11867 states and 23302 transitions. [2022-03-03 18:26:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:39,986 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:39,986 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:39,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-03 18:26:39,986 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:39,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:39,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1322619875, now seen corresponding path program 8 times [2022-03-03 18:26:39,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:39,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545943193] [2022-03-03 18:26:39,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:40,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:40,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545943193] [2022-03-03 18:26:40,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545943193] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:40,250 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:40,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:40,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907400069] [2022-03-03 18:26:40,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:40,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:40,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:40,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:40,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:40,251 INFO L87 Difference]: Start difference. First operand 11867 states and 23302 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:41,437 INFO L93 Difference]: Finished difference Result 13688 states and 26878 transitions. [2022-03-03 18:26:41,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:26:41,437 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:41,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:41,456 INFO L225 Difference]: With dead ends: 13688 [2022-03-03 18:26:41,456 INFO L226 Difference]: Without dead ends: 13688 [2022-03-03 18:26:41,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2022-03-03 18:26:41,457 INFO L933 BasicCegarLoop]: 619 mSDtfsCounter, 612 mSDsluCounter, 2627 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:41,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 3246 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:26:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13688 states. [2022-03-03 18:26:41,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13688 to 11875. [2022-03-03 18:26:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11875 states, 11806 states have (on average 1.9750974080975776) internal successors, (23318), 11874 states have internal predecessors, (23318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11875 states to 11875 states and 23318 transitions. [2022-03-03 18:26:41,612 INFO L78 Accepts]: Start accepts. Automaton has 11875 states and 23318 transitions. Word has length 476 [2022-03-03 18:26:41,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:41,612 INFO L470 AbstractCegarLoop]: Abstraction has 11875 states and 23318 transitions. [2022-03-03 18:26:41,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 11875 states and 23318 transitions. [2022-03-03 18:26:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:41,615 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:41,616 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:41,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-03 18:26:41,616 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:41,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:41,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1273469729, now seen corresponding path program 9 times [2022-03-03 18:26:41,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:41,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277692658] [2022-03-03 18:26:41,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:41,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:41,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:41,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277692658] [2022-03-03 18:26:41,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277692658] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:41,955 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:41,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:41,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616876771] [2022-03-03 18:26:41,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:41,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:41,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:41,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:41,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:41,957 INFO L87 Difference]: Start difference. First operand 11875 states and 23318 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:43,175 INFO L93 Difference]: Finished difference Result 13858 states and 27218 transitions. [2022-03-03 18:26:43,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:26:43,175 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:43,192 INFO L225 Difference]: With dead ends: 13858 [2022-03-03 18:26:43,193 INFO L226 Difference]: Without dead ends: 13858 [2022-03-03 18:26:43,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:26:43,193 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 640 mSDsluCounter, 2651 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 3277 SdHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:43,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [640 Valid, 3277 Invalid, 2419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:26:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13858 states. [2022-03-03 18:26:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13858 to 11883. [2022-03-03 18:26:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11883 states, 11814 states have (on average 1.9751142712036567) internal successors, (23334), 11882 states have internal predecessors, (23334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-03 18:26:43,337 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-03 18:26:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:43,337 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-03 18:26:43,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-03 18:26:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:43,340 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:43,340 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:43,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-03 18:26:43,340 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:43,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1062346467, now seen corresponding path program 10 times [2022-03-03 18:26:43,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:43,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595531785] [2022-03-03 18:26:43,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:43,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:43,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:43,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595531785] [2022-03-03 18:26:43,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595531785] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:43,651 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:43,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:43,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291297923] [2022-03-03 18:26:43,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:43,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:43,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:43,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:43,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:43,652 INFO L87 Difference]: Start difference. First operand 11883 states and 23334 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:44,935 INFO L93 Difference]: Finished difference Result 13640 states and 26782 transitions. [2022-03-03 18:26:44,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:26:44,935 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:44,952 INFO L225 Difference]: With dead ends: 13640 [2022-03-03 18:26:44,953 INFO L226 Difference]: Without dead ends: 13640 [2022-03-03 18:26:44,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-03 18:26:44,953 INFO L933 BasicCegarLoop]: 668 mSDtfsCounter, 693 mSDsluCounter, 2755 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 3423 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:44,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 3423 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 18:26:44,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13640 states. [2022-03-03 18:26:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13640 to 11884. [2022-03-03 18:26:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11884 states, 11815 states have (on average 1.9751163774862464) internal successors, (23336), 11883 states have internal predecessors, (23336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11884 states to 11884 states and 23336 transitions. [2022-03-03 18:26:45,098 INFO L78 Accepts]: Start accepts. Automaton has 11884 states and 23336 transitions. Word has length 476 [2022-03-03 18:26:45,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:45,099 INFO L470 AbstractCegarLoop]: Abstraction has 11884 states and 23336 transitions. [2022-03-03 18:26:45,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:45,099 INFO L276 IsEmpty]: Start isEmpty. Operand 11884 states and 23336 transitions. [2022-03-03 18:26:45,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:45,102 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:45,102 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:45,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-03 18:26:45,102 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:45,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:45,102 INFO L85 PathProgramCache]: Analyzing trace with hash 382849019, now seen corresponding path program 11 times [2022-03-03 18:26:45,103 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:45,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568322274] [2022-03-03 18:26:45,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:45,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:45,389 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:45,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568322274] [2022-03-03 18:26:45,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568322274] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:45,389 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:45,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:45,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362752687] [2022-03-03 18:26:45,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:45,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:45,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:45,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:45,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:45,390 INFO L87 Difference]: Start difference. First operand 11884 states and 23336 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:46,926 INFO L93 Difference]: Finished difference Result 13799 states and 27100 transitions. [2022-03-03 18:26:46,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:26:46,926 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:46,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:46,943 INFO L225 Difference]: With dead ends: 13799 [2022-03-03 18:26:46,943 INFO L226 Difference]: Without dead ends: 13799 [2022-03-03 18:26:46,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:26:46,944 INFO L933 BasicCegarLoop]: 676 mSDtfsCounter, 691 mSDsluCounter, 2869 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:46,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [691 Valid, 3545 Invalid, 2778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 18:26:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13799 states. [2022-03-03 18:26:47,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13799 to 11883. [2022-03-03 18:26:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11883 states, 11814 states have (on average 1.9751142712036567) internal successors, (23334), 11882 states have internal predecessors, (23334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-03 18:26:47,082 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-03 18:26:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:47,082 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-03 18:26:47,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-03 18:26:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:47,085 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:47,085 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:47,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-03 18:26:47,086 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:47,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:47,086 INFO L85 PathProgramCache]: Analyzing trace with hash 153013153, now seen corresponding path program 12 times [2022-03-03 18:26:47,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:47,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243549515] [2022-03-03 18:26:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:47,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:47,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:47,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243549515] [2022-03-03 18:26:47,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243549515] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:47,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:47,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:47,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174713626] [2022-03-03 18:26:47,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:47,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:47,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:47,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:47,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:47,396 INFO L87 Difference]: Start difference. First operand 11883 states and 23334 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:48,921 INFO L93 Difference]: Finished difference Result 13633 states and 26767 transitions. [2022-03-03 18:26:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:26:48,921 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:48,939 INFO L225 Difference]: With dead ends: 13633 [2022-03-03 18:26:48,939 INFO L226 Difference]: Without dead ends: 13633 [2022-03-03 18:26:48,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:26:48,940 INFO L933 BasicCegarLoop]: 737 mSDtfsCounter, 749 mSDsluCounter, 3079 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 3816 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:48,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [749 Valid, 3816 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 18:26:48,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13633 states. [2022-03-03 18:26:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13633 to 11883. [2022-03-03 18:26:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11883 states, 11814 states have (on average 1.9751142712036567) internal successors, (23334), 11882 states have internal predecessors, (23334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-03 18:26:49,079 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-03 18:26:49,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:49,079 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-03 18:26:49,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-03 18:26:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:49,083 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:49,083 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:49,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-03 18:26:49,083 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:49,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:49,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1403214081, now seen corresponding path program 13 times [2022-03-03 18:26:49,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:49,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054733012] [2022-03-03 18:26:49,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:49,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:49,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054733012] [2022-03-03 18:26:49,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054733012] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:49,364 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:49,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:49,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074701393] [2022-03-03 18:26:49,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:49,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:49,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:49,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:49,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:49,365 INFO L87 Difference]: Start difference. First operand 11883 states and 23334 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:50,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:50,318 INFO L93 Difference]: Finished difference Result 13686 states and 26874 transitions. [2022-03-03 18:26:50,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:26:50,319 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:50,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:50,337 INFO L225 Difference]: With dead ends: 13686 [2022-03-03 18:26:50,337 INFO L226 Difference]: Without dead ends: 13686 [2022-03-03 18:26:50,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:26:50,338 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 616 mSDsluCounter, 2460 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:50,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 3077 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 18:26:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13686 states. [2022-03-03 18:26:50,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13686 to 11889. [2022-03-03 18:26:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11889 states, 11820 states have (on average 1.9751269035532995) internal successors, (23346), 11888 states have internal predecessors, (23346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11889 states to 11889 states and 23346 transitions. [2022-03-03 18:26:50,519 INFO L78 Accepts]: Start accepts. Automaton has 11889 states and 23346 transitions. Word has length 476 [2022-03-03 18:26:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:50,520 INFO L470 AbstractCegarLoop]: Abstraction has 11889 states and 23346 transitions. [2022-03-03 18:26:50,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 11889 states and 23346 transitions. [2022-03-03 18:26:50,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:50,523 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:50,523 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:50,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-03 18:26:50,523 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:50,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:50,524 INFO L85 PathProgramCache]: Analyzing trace with hash 41981405, now seen corresponding path program 14 times [2022-03-03 18:26:50,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:50,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711490514] [2022-03-03 18:26:50,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:50,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:50,807 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:50,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711490514] [2022-03-03 18:26:50,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711490514] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:50,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:50,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:50,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609398314] [2022-03-03 18:26:50,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:50,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:50,808 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:50,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:50,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:50,808 INFO L87 Difference]: Start difference. First operand 11889 states and 23346 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:51,647 INFO L93 Difference]: Finished difference Result 13769 states and 27040 transitions. [2022-03-03 18:26:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:26:51,647 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:51,664 INFO L225 Difference]: With dead ends: 13769 [2022-03-03 18:26:51,664 INFO L226 Difference]: Without dead ends: 13769 [2022-03-03 18:26:51,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2022-03-03 18:26:51,665 INFO L933 BasicCegarLoop]: 625 mSDtfsCounter, 617 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:51,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 2803 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:26:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13769 states. [2022-03-03 18:26:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 11888. [2022-03-03 18:26:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11888 states, 11819 states have (on average 1.9751247990523733) internal successors, (23344), 11887 states have internal predecessors, (23344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11888 states to 11888 states and 23344 transitions. [2022-03-03 18:26:51,807 INFO L78 Accepts]: Start accepts. Automaton has 11888 states and 23344 transitions. Word has length 476 [2022-03-03 18:26:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:51,807 INFO L470 AbstractCegarLoop]: Abstraction has 11888 states and 23344 transitions. [2022-03-03 18:26:51,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 11888 states and 23344 transitions. [2022-03-03 18:26:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:51,810 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:51,811 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:51,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-03 18:26:51,811 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:51,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1656896287, now seen corresponding path program 15 times [2022-03-03 18:26:51,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:51,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352705116] [2022-03-03 18:26:51,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:51,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:52,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:52,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352705116] [2022-03-03 18:26:52,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352705116] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:52,084 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:52,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:52,085 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759668852] [2022-03-03 18:26:52,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:52,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:52,085 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:52,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:52,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:52,086 INFO L87 Difference]: Start difference. First operand 11888 states and 23344 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:53,075 INFO L93 Difference]: Finished difference Result 13833 states and 27168 transitions. [2022-03-03 18:26:53,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-03 18:26:53,075 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:53,093 INFO L225 Difference]: With dead ends: 13833 [2022-03-03 18:26:53,093 INFO L226 Difference]: Without dead ends: 13833 [2022-03-03 18:26:53,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-03-03 18:26:53,094 INFO L933 BasicCegarLoop]: 632 mSDtfsCounter, 630 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:53,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 3160 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 18:26:53,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13833 states. [2022-03-03 18:26:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13833 to 11887. [2022-03-03 18:26:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11887 states, 11818 states have (on average 1.9751226941952953) internal successors, (23342), 11886 states have internal predecessors, (23342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 23342 transitions. [2022-03-03 18:26:53,241 INFO L78 Accepts]: Start accepts. Automaton has 11887 states and 23342 transitions. Word has length 476 [2022-03-03 18:26:53,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:53,241 INFO L470 AbstractCegarLoop]: Abstraction has 11887 states and 23342 transitions. [2022-03-03 18:26:53,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand 11887 states and 23342 transitions. [2022-03-03 18:26:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:53,245 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:53,245 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:53,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-03 18:26:53,245 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:53,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1171556229, now seen corresponding path program 16 times [2022-03-03 18:26:53,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:53,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98091368] [2022-03-03 18:26:53,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:53,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:53,516 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:53,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98091368] [2022-03-03 18:26:53,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98091368] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:53,516 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:53,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:53,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682594095] [2022-03-03 18:26:53,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:53,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:53,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:53,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:53,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:53,518 INFO L87 Difference]: Start difference. First operand 11887 states and 23342 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:54,980 INFO L93 Difference]: Finished difference Result 23633 states and 46768 transitions. [2022-03-03 18:26:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-03 18:26:54,980 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:54,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:55,013 INFO L225 Difference]: With dead ends: 23633 [2022-03-03 18:26:55,013 INFO L226 Difference]: Without dead ends: 23633 [2022-03-03 18:26:55,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-03-03 18:26:55,014 INFO L933 BasicCegarLoop]: 917 mSDtfsCounter, 1277 mSDsluCounter, 3813 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 4730 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:55,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1277 Valid, 4730 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:26:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23633 states. [2022-03-03 18:26:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23633 to 11919. [2022-03-03 18:26:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11919 states, 11850 states have (on average 1.9751898734177216) internal successors, (23406), 11918 states have internal predecessors, (23406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:55,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11919 states to 11919 states and 23406 transitions. [2022-03-03 18:26:55,210 INFO L78 Accepts]: Start accepts. Automaton has 11919 states and 23406 transitions. Word has length 476 [2022-03-03 18:26:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:55,211 INFO L470 AbstractCegarLoop]: Abstraction has 11919 states and 23406 transitions. [2022-03-03 18:26:55,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 11919 states and 23406 transitions. [2022-03-03 18:26:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:55,214 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:55,214 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:55,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-03 18:26:55,214 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:55,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash 514617029, now seen corresponding path program 13 times [2022-03-03 18:26:55,215 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:55,215 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518775260] [2022-03-03 18:26:55,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:55,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:55,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:55,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518775260] [2022-03-03 18:26:55,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518775260] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:55,496 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:55,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:26:55,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115088204] [2022-03-03 18:26:55,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:55,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:26:55,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:55,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:26:55,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:26:55,497 INFO L87 Difference]: Start difference. First operand 11919 states and 23406 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:57,641 INFO L93 Difference]: Finished difference Result 23388 states and 46278 transitions. [2022-03-03 18:26:57,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-03 18:26:57,641 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:57,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:57,676 INFO L225 Difference]: With dead ends: 23388 [2022-03-03 18:26:57,676 INFO L226 Difference]: Without dead ends: 23388 [2022-03-03 18:26:57,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=1574, Unknown=0, NotChecked=0, Total=2070 [2022-03-03 18:26:57,677 INFO L933 BasicCegarLoop]: 1049 mSDtfsCounter, 1521 mSDsluCounter, 5294 mSDsCounter, 0 mSdLazyCounter, 4098 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 6340 SdHoareTripleChecker+Invalid, 4178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:57,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 6340 Invalid, 4178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4098 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-03 18:26:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23388 states. [2022-03-03 18:26:57,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23388 to 11863. [2022-03-03 18:26:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11863 states, 11794 states have (on average 1.9754112260471426) internal successors, (23298), 11862 states have internal predecessors, (23298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11863 states to 11863 states and 23298 transitions. [2022-03-03 18:26:57,874 INFO L78 Accepts]: Start accepts. Automaton has 11863 states and 23298 transitions. Word has length 476 [2022-03-03 18:26:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:57,874 INFO L470 AbstractCegarLoop]: Abstraction has 11863 states and 23298 transitions. [2022-03-03 18:26:57,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 11863 states and 23298 transitions. [2022-03-03 18:26:57,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:57,878 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:57,878 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:57,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-03 18:26:57,878 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:57,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:57,879 INFO L85 PathProgramCache]: Analyzing trace with hash 289716163, now seen corresponding path program 17 times [2022-03-03 18:26:57,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:57,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123436274] [2022-03-03 18:26:57,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:57,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:58,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:58,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123436274] [2022-03-03 18:26:58,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123436274] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:58,184 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:58,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:58,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055998277] [2022-03-03 18:26:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:58,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:58,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:58,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:58,185 INFO L87 Difference]: Start difference. First operand 11863 states and 23298 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:26:59,119 INFO L93 Difference]: Finished difference Result 12207 states and 23984 transitions. [2022-03-03 18:26:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:26:59,120 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:26:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:26:59,134 INFO L225 Difference]: With dead ends: 12207 [2022-03-03 18:26:59,134 INFO L226 Difference]: Without dead ends: 12207 [2022-03-03 18:26:59,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-03 18:26:59,135 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 298 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 3240 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:26:59,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 3240 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:26:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12207 states. [2022-03-03 18:26:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12207 to 11879. [2022-03-03 18:26:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11879 states, 11810 states have (on average 1.9754445385266723) internal successors, (23330), 11878 states have internal predecessors, (23330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11879 states to 11879 states and 23330 transitions. [2022-03-03 18:26:59,274 INFO L78 Accepts]: Start accepts. Automaton has 11879 states and 23330 transitions. Word has length 476 [2022-03-03 18:26:59,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:26:59,274 INFO L470 AbstractCegarLoop]: Abstraction has 11879 states and 23330 transitions. [2022-03-03 18:26:59,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:26:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 11879 states and 23330 transitions. [2022-03-03 18:26:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:26:59,277 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:26:59,277 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:26:59,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-03 18:26:59,277 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:26:59,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:26:59,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1734911649, now seen corresponding path program 18 times [2022-03-03 18:26:59,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:26:59,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239934011] [2022-03-03 18:26:59,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:26:59,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:26:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:26:59,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:26:59,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:26:59,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239934011] [2022-03-03 18:26:59,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239934011] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:26:59,530 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:26:59,530 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:26:59,530 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316758096] [2022-03-03 18:26:59,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:26:59,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:26:59,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:26:59,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:26:59,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:26:59,531 INFO L87 Difference]: Start difference. First operand 11879 states and 23330 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:00,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:00,333 INFO L93 Difference]: Finished difference Result 12290 states and 24150 transitions. [2022-03-03 18:27:00,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:27:00,333 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:27:00,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:00,348 INFO L225 Difference]: With dead ends: 12290 [2022-03-03 18:27:00,348 INFO L226 Difference]: Without dead ends: 12290 [2022-03-03 18:27:00,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-03-03 18:27:00,349 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 313 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:00,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 2725 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:27:00,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12290 states. [2022-03-03 18:27:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12290 to 11887. [2022-03-03 18:27:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11887 states, 11818 states have (on average 1.9754611609409376) internal successors, (23346), 11886 states have internal predecessors, (23346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 23346 transitions. [2022-03-03 18:27:00,480 INFO L78 Accepts]: Start accepts. Automaton has 11887 states and 23346 transitions. Word has length 476 [2022-03-03 18:27:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:00,481 INFO L470 AbstractCegarLoop]: Abstraction has 11887 states and 23346 transitions. [2022-03-03 18:27:00,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 11887 states and 23346 transitions. [2022-03-03 18:27:00,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:27:00,484 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:00,484 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:00,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-03 18:27:00,484 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:00,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:00,484 INFO L85 PathProgramCache]: Analyzing trace with hash 36033957, now seen corresponding path program 19 times [2022-03-03 18:27:00,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:00,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027839088] [2022-03-03 18:27:00,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:00,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:00,725 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:00,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027839088] [2022-03-03 18:27:00,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027839088] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:00,725 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:00,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:00,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967742557] [2022-03-03 18:27:00,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:00,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:00,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:00,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:00,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:00,726 INFO L87 Difference]: Start difference. First operand 11887 states and 23346 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:01,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:01,423 INFO L93 Difference]: Finished difference Result 12354 states and 24278 transitions. [2022-03-03 18:27:01,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:27:01,423 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:27:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:01,438 INFO L225 Difference]: With dead ends: 12354 [2022-03-03 18:27:01,439 INFO L226 Difference]: Without dead ends: 12354 [2022-03-03 18:27:01,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:27:01,439 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 330 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:01,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 2482 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:27:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12354 states. [2022-03-03 18:27:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12354 to 11895. [2022-03-03 18:27:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11895 states, 11826 states have (on average 1.9754777608658887) internal successors, (23362), 11894 states have internal predecessors, (23362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11895 states to 11895 states and 23362 transitions. [2022-03-03 18:27:01,615 INFO L78 Accepts]: Start accepts. Automaton has 11895 states and 23362 transitions. Word has length 476 [2022-03-03 18:27:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:01,615 INFO L470 AbstractCegarLoop]: Abstraction has 11895 states and 23362 transitions. [2022-03-03 18:27:01,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 11895 states and 23362 transitions. [2022-03-03 18:27:01,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:27:01,618 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:01,618 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:01,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-03 18:27:01,618 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:01,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:01,619 INFO L85 PathProgramCache]: Analyzing trace with hash 521374015, now seen corresponding path program 20 times [2022-03-03 18:27:01,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:01,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221879156] [2022-03-03 18:27:01,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:01,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:01,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:01,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221879156] [2022-03-03 18:27:01,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221879156] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:01,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:01,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:01,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131782393] [2022-03-03 18:27:01,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:01,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:01,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:01,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:01,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:01,873 INFO L87 Difference]: Start difference. First operand 11895 states and 23362 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:03,504 INFO L93 Difference]: Finished difference Result 22106 states and 43782 transitions. [2022-03-03 18:27:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 18:27:03,504 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:27:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:03,534 INFO L225 Difference]: With dead ends: 22106 [2022-03-03 18:27:03,535 INFO L226 Difference]: Without dead ends: 22106 [2022-03-03 18:27:03,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:27:03,535 INFO L933 BasicCegarLoop]: 813 mSDtfsCounter, 972 mSDsluCounter, 4367 mSDsCounter, 0 mSdLazyCounter, 3374 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 5180 SdHoareTripleChecker+Invalid, 3430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:03,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [972 Valid, 5180 Invalid, 3430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3374 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 18:27:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22106 states. [2022-03-03 18:27:03,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22106 to 11927. [2022-03-03 18:27:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11927 states, 11858 states have (on average 1.9755439365828977) internal successors, (23426), 11926 states have internal predecessors, (23426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11927 states to 11927 states and 23426 transitions. [2022-03-03 18:27:03,729 INFO L78 Accepts]: Start accepts. Automaton has 11927 states and 23426 transitions. Word has length 476 [2022-03-03 18:27:03,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:03,729 INFO L470 AbstractCegarLoop]: Abstraction has 11927 states and 23426 transitions. [2022-03-03 18:27:03,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 11927 states and 23426 transitions. [2022-03-03 18:27:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:27:03,732 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:03,732 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:03,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-03 18:27:03,732 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:03,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:03,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2087420023, now seen corresponding path program 14 times [2022-03-03 18:27:03,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:03,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203069828] [2022-03-03 18:27:03,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:03,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:03,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:03,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203069828] [2022-03-03 18:27:03,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203069828] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:03,976 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:03,976 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:27:03,976 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001693363] [2022-03-03 18:27:03,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:03,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:27:03,977 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:03,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:27:03,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:27:03,977 INFO L87 Difference]: Start difference. First operand 11927 states and 23426 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:05,351 INFO L93 Difference]: Finished difference Result 21911 states and 43392 transitions. [2022-03-03 18:27:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 18:27:05,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:27:05,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:05,382 INFO L225 Difference]: With dead ends: 21911 [2022-03-03 18:27:05,383 INFO L226 Difference]: Without dead ends: 21911 [2022-03-03 18:27:05,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2022-03-03 18:27:05,384 INFO L933 BasicCegarLoop]: 919 mSDtfsCounter, 1149 mSDsluCounter, 3921 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:05,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1149 Valid, 4839 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-03 18:27:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21911 states. [2022-03-03 18:27:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21911 to 11848. [2022-03-03 18:27:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11779 states have (on average 1.9753799134052126) internal successors, (23268), 11847 states have internal predecessors, (23268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 23268 transitions. [2022-03-03 18:27:05,621 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 23268 transitions. Word has length 476 [2022-03-03 18:27:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:05,621 INFO L470 AbstractCegarLoop]: Abstraction has 11848 states and 23268 transitions. [2022-03-03 18:27:05,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 23268 transitions. [2022-03-03 18:27:05,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:27:05,624 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:05,624 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:05,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-03 18:27:05,624 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:05,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:05,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1932368251, now seen corresponding path program 21 times [2022-03-03 18:27:05,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:05,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793052410] [2022-03-03 18:27:05,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:05,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:05,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:05,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793052410] [2022-03-03 18:27:05,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793052410] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:05,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:05,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:05,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896575945] [2022-03-03 18:27:05,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:05,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:05,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:05,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:05,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:05,887 INFO L87 Difference]: Start difference. First operand 11848 states and 23268 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:07,289 INFO L93 Difference]: Finished difference Result 21819 states and 43200 transitions. [2022-03-03 18:27:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:27:07,289 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:27:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:07,319 INFO L225 Difference]: With dead ends: 21819 [2022-03-03 18:27:07,320 INFO L226 Difference]: Without dead ends: 21819 [2022-03-03 18:27:07,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-03-03 18:27:07,320 INFO L933 BasicCegarLoop]: 842 mSDtfsCounter, 933 mSDsluCounter, 3959 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 4801 SdHoareTripleChecker+Invalid, 2961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:07,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [933 Valid, 4801 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:27:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21819 states. [2022-03-03 18:27:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21819 to 11741. [2022-03-03 18:27:07,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11741 states, 11673 states have (on average 1.9742996658956566) internal successors, (23046), 11740 states have internal predecessors, (23046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 23046 transitions. [2022-03-03 18:27:07,519 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 23046 transitions. Word has length 476 [2022-03-03 18:27:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:07,520 INFO L470 AbstractCegarLoop]: Abstraction has 11741 states and 23046 transitions. [2022-03-03 18:27:07,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 23046 transitions. [2022-03-03 18:27:07,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-03 18:27:07,523 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:07,523 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:07,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-03 18:27:07,523 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:07,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash -676425787, now seen corresponding path program 15 times [2022-03-03 18:27:07,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:07,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385755425] [2022-03-03 18:27:07,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:07,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:07,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:07,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385755425] [2022-03-03 18:27:07,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385755425] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:07,801 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:07,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-03 18:27:07,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177060089] [2022-03-03 18:27:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:07,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 18:27:07,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:07,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 18:27:07,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-03 18:27:07,802 INFO L87 Difference]: Start difference. First operand 11741 states and 23046 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:09,691 INFO L93 Difference]: Finished difference Result 21742 states and 43046 transitions. [2022-03-03 18:27:09,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-03 18:27:09,691 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-03 18:27:09,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:09,721 INFO L225 Difference]: With dead ends: 21742 [2022-03-03 18:27:09,721 INFO L226 Difference]: Without dead ends: 21742 [2022-03-03 18:27:09,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=1182, Unknown=0, NotChecked=0, Total=1560 [2022-03-03 18:27:09,722 INFO L933 BasicCegarLoop]: 953 mSDtfsCounter, 1095 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 5795 SdHoareTripleChecker+Invalid, 3774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:09,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1095 Valid, 5795 Invalid, 3774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-03 18:27:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21742 states. [2022-03-03 18:27:09,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21742 to 11608. [2022-03-03 18:27:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11608 states, 11540 states have (on average 1.974003466204506) internal successors, (22780), 11607 states have internal predecessors, (22780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11608 states to 11608 states and 22780 transitions. [2022-03-03 18:27:09,944 INFO L78 Accepts]: Start accepts. Automaton has 11608 states and 22780 transitions. Word has length 476 [2022-03-03 18:27:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:09,945 INFO L470 AbstractCegarLoop]: Abstraction has 11608 states and 22780 transitions. [2022-03-03 18:27:09,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 11608 states and 22780 transitions. [2022-03-03 18:27:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2022-03-03 18:27:09,947 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:09,947 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:09,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-03 18:27:09,948 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:09,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:09,948 INFO L85 PathProgramCache]: Analyzing trace with hash -433569237, now seen corresponding path program 1 times [2022-03-03 18:27:09,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:09,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353174589] [2022-03-03 18:27:09,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:09,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:10,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:10,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353174589] [2022-03-03 18:27:10,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353174589] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:10,139 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:10,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:27:10,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753289026] [2022-03-03 18:27:10,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:10,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:27:10,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:10,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:27:10,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:27:10,140 INFO L87 Difference]: Start difference. First operand 11608 states and 22780 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:10,604 INFO L93 Difference]: Finished difference Result 15459 states and 30482 transitions. [2022-03-03 18:27:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:27:10,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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 477 [2022-03-03 18:27:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:10,624 INFO L225 Difference]: With dead ends: 15459 [2022-03-03 18:27:10,624 INFO L226 Difference]: Without dead ends: 15459 [2022-03-03 18:27:10,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:27:10,625 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 294 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:10,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 890 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 18:27:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15459 states. [2022-03-03 18:27:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15459 to 12246. [2022-03-03 18:27:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12246 states, 12178 states have (on average 1.975365413039908) internal successors, (24056), 12245 states have internal predecessors, (24056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12246 states to 12246 states and 24056 transitions. [2022-03-03 18:27:10,776 INFO L78 Accepts]: Start accepts. Automaton has 12246 states and 24056 transitions. Word has length 477 [2022-03-03 18:27:10,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:10,777 INFO L470 AbstractCegarLoop]: Abstraction has 12246 states and 24056 transitions. [2022-03-03 18:27:10,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 12246 states and 24056 transitions. [2022-03-03 18:27:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2022-03-03 18:27:10,779 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:10,779 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:10,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-03 18:27:10,780 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:10,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash -162702783, now seen corresponding path program 1 times [2022-03-03 18:27:10,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:10,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738993159] [2022-03-03 18:27:10,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:10,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:10,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:10,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738993159] [2022-03-03 18:27:10,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738993159] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:10,995 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:10,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:27:10,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889297026] [2022-03-03 18:27:10,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:10,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:27:10,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:10,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:27:10,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:27:10,996 INFO L87 Difference]: Start difference. First operand 12246 states and 24056 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:11,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:11,644 INFO L93 Difference]: Finished difference Result 14561 states and 28686 transitions. [2022-03-03 18:27:11,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:27:11,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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 477 [2022-03-03 18:27:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:11,663 INFO L225 Difference]: With dead ends: 14561 [2022-03-03 18:27:11,663 INFO L226 Difference]: Without dead ends: 14561 [2022-03-03 18:27:11,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:27:11,664 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 325 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:11,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 1214 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:27:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14561 states. [2022-03-03 18:27:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14561 to 12666. [2022-03-03 18:27:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12666 states, 12600 states have (on average 1.9758730158730158) internal successors, (24896), 12665 states have internal predecessors, (24896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12666 states to 12666 states and 24896 transitions. [2022-03-03 18:27:11,821 INFO L78 Accepts]: Start accepts. Automaton has 12666 states and 24896 transitions. Word has length 477 [2022-03-03 18:27:11,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:11,821 INFO L470 AbstractCegarLoop]: Abstraction has 12666 states and 24896 transitions. [2022-03-03 18:27:11,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand 12666 states and 24896 transitions. [2022-03-03 18:27:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:11,825 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:11,825 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:11,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-03-03 18:27:11,825 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:11,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:11,825 INFO L85 PathProgramCache]: Analyzing trace with hash -849059536, now seen corresponding path program 1 times [2022-03-03 18:27:11,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:11,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106714172] [2022-03-03 18:27:11,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:12,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:12,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106714172] [2022-03-03 18:27:12,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106714172] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:12,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:12,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:12,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659376287] [2022-03-03 18:27:12,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:12,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:12,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:12,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:12,084 INFO L87 Difference]: Start difference. First operand 12666 states and 24896 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:13,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:13,095 INFO L93 Difference]: Finished difference Result 12802 states and 25168 transitions. [2022-03-03 18:27:13,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-03 18:27:13,095 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:13,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:13,111 INFO L225 Difference]: With dead ends: 12802 [2022-03-03 18:27:13,111 INFO L226 Difference]: Without dead ends: 12802 [2022-03-03 18:27:13,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-03-03 18:27:13,112 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 565 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:13,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 2745 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:27:13,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2022-03-03 18:27:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 12683. [2022-03-03 18:27:13,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12683 states, 12617 states have (on average 1.9759055242926211) internal successors, (24930), 12682 states have internal predecessors, (24930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12683 states to 12683 states and 24930 transitions. [2022-03-03 18:27:13,263 INFO L78 Accepts]: Start accepts. Automaton has 12683 states and 24930 transitions. Word has length 484 [2022-03-03 18:27:13,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:13,263 INFO L470 AbstractCegarLoop]: Abstraction has 12683 states and 24930 transitions. [2022-03-03 18:27:13,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 12683 states and 24930 transitions. [2022-03-03 18:27:13,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:13,267 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:13,267 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:13,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-03 18:27:13,268 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:13,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:13,268 INFO L85 PathProgramCache]: Analyzing trace with hash -253401254, now seen corresponding path program 2 times [2022-03-03 18:27:13,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:13,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169364880] [2022-03-03 18:27:13,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:13,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:13,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:13,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169364880] [2022-03-03 18:27:13,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169364880] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:13,524 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:13,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:13,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043786793] [2022-03-03 18:27:13,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:13,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:13,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:13,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:13,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:13,525 INFO L87 Difference]: Start difference. First operand 12683 states and 24930 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:14,680 INFO L93 Difference]: Finished difference Result 12858 states and 25280 transitions. [2022-03-03 18:27:14,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:27:14,680 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:14,696 INFO L225 Difference]: With dead ends: 12858 [2022-03-03 18:27:14,696 INFO L226 Difference]: Without dead ends: 12858 [2022-03-03 18:27:14,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:27:14,697 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 585 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:14,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 3092 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:27:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12858 states. [2022-03-03 18:27:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12858 to 12703. [2022-03-03 18:27:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12703 states, 12637 states have (on average 1.9759436575136504) internal successors, (24970), 12702 states have internal predecessors, (24970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12703 states to 12703 states and 24970 transitions. [2022-03-03 18:27:14,843 INFO L78 Accepts]: Start accepts. Automaton has 12703 states and 24970 transitions. Word has length 484 [2022-03-03 18:27:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:14,843 INFO L470 AbstractCegarLoop]: Abstraction has 12703 states and 24970 transitions. [2022-03-03 18:27:14,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 12703 states and 24970 transitions. [2022-03-03 18:27:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:14,847 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:14,847 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:14,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-03-03 18:27:14,847 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:14,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:14,848 INFO L85 PathProgramCache]: Analyzing trace with hash 698086230, now seen corresponding path program 3 times [2022-03-03 18:27:14,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:14,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728419882] [2022-03-03 18:27:14,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:14,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:15,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:15,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728419882] [2022-03-03 18:27:15,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728419882] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:15,104 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:15,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:15,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265107303] [2022-03-03 18:27:15,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:15,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:15,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:15,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:15,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:15,105 INFO L87 Difference]: Start difference. First operand 12703 states and 24970 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:16,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:16,237 INFO L93 Difference]: Finished difference Result 12891 states and 25346 transitions. [2022-03-03 18:27:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:27:16,238 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:16,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:16,315 INFO L225 Difference]: With dead ends: 12891 [2022-03-03 18:27:16,316 INFO L226 Difference]: Without dead ends: 12891 [2022-03-03 18:27:16,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:27:16,316 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 578 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:16,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 2818 Invalid, 2128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:27:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12891 states. [2022-03-03 18:27:16,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12891 to 12704. [2022-03-03 18:27:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12704 states, 12638 states have (on average 1.9759455610064884) internal successors, (24972), 12703 states have internal predecessors, (24972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:16,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12704 states to 12704 states and 24972 transitions. [2022-03-03 18:27:16,450 INFO L78 Accepts]: Start accepts. Automaton has 12704 states and 24972 transitions. Word has length 484 [2022-03-03 18:27:16,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:16,450 INFO L470 AbstractCegarLoop]: Abstraction has 12704 states and 24972 transitions. [2022-03-03 18:27:16,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 12704 states and 24972 transitions. [2022-03-03 18:27:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:16,453 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:16,453 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:16,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-03-03 18:27:16,454 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:16,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash -131444940, now seen corresponding path program 4 times [2022-03-03 18:27:16,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:16,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741222381] [2022-03-03 18:27:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:16,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:16,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:16,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741222381] [2022-03-03 18:27:16,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741222381] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:16,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:16,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:16,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169911562] [2022-03-03 18:27:16,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:16,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:16,695 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:16,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:16,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:16,695 INFO L87 Difference]: Start difference. First operand 12704 states and 24972 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:18,055 INFO L93 Difference]: Finished difference Result 12912 states and 25388 transitions. [2022-03-03 18:27:18,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:27:18,056 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:18,072 INFO L225 Difference]: With dead ends: 12912 [2022-03-03 18:27:18,072 INFO L226 Difference]: Without dead ends: 12912 [2022-03-03 18:27:18,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:27:18,072 INFO L933 BasicCegarLoop]: 584 mSDtfsCounter, 601 mSDsluCounter, 2720 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 3300 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:18,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 3300 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:27:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2022-03-03 18:27:18,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 12723. [2022-03-03 18:27:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12723 states, 12657 states have (on average 1.9759816702220114) internal successors, (25010), 12722 states have internal predecessors, (25010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12723 states to 12723 states and 25010 transitions. [2022-03-03 18:27:18,221 INFO L78 Accepts]: Start accepts. Automaton has 12723 states and 25010 transitions. Word has length 484 [2022-03-03 18:27:18,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:18,221 INFO L470 AbstractCegarLoop]: Abstraction has 12723 states and 25010 transitions. [2022-03-03 18:27:18,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 12723 states and 25010 transitions. [2022-03-03 18:27:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:18,224 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:18,225 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:18,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-03-03 18:27:18,225 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:18,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:18,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1589475738, now seen corresponding path program 5 times [2022-03-03 18:27:18,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:18,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914244839] [2022-03-03 18:27:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:18,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:18,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:18,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914244839] [2022-03-03 18:27:18,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914244839] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:18,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:18,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:18,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991298669] [2022-03-03 18:27:18,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:18,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:18,438 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:18,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:18,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:18,439 INFO L87 Difference]: Start difference. First operand 12723 states and 25010 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:19,382 INFO L93 Difference]: Finished difference Result 12970 states and 25504 transitions. [2022-03-03 18:27:19,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-03 18:27:19,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:19,400 INFO L225 Difference]: With dead ends: 12970 [2022-03-03 18:27:19,400 INFO L226 Difference]: Without dead ends: 12970 [2022-03-03 18:27:19,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-03-03 18:27:19,400 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 613 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 2440 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:19,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 2440 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:27:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12970 states. [2022-03-03 18:27:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12970 to 12743. [2022-03-03 18:27:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12743 states, 12677 states have (on average 1.9760195629880886) internal successors, (25050), 12742 states have internal predecessors, (25050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12743 states to 12743 states and 25050 transitions. [2022-03-03 18:27:19,644 INFO L78 Accepts]: Start accepts. Automaton has 12743 states and 25050 transitions. Word has length 484 [2022-03-03 18:27:19,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:19,645 INFO L470 AbstractCegarLoop]: Abstraction has 12743 states and 25050 transitions. [2022-03-03 18:27:19,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:19,645 INFO L276 IsEmpty]: Start isEmpty. Operand 12743 states and 25050 transitions. [2022-03-03 18:27:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:19,648 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:19,648 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:19,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-03 18:27:19,648 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:19,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:19,649 INFO L85 PathProgramCache]: Analyzing trace with hash -372395052, now seen corresponding path program 6 times [2022-03-03 18:27:19,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:19,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810152142] [2022-03-03 18:27:19,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:19,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:19,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:19,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810152142] [2022-03-03 18:27:19,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810152142] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:19,877 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:19,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:19,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434004843] [2022-03-03 18:27:19,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:19,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:19,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:19,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:19,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:19,878 INFO L87 Difference]: Start difference. First operand 12743 states and 25050 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:21,132 INFO L93 Difference]: Finished difference Result 13201 states and 25966 transitions. [2022-03-03 18:27:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-03 18:27:21,132 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:21,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:21,153 INFO L225 Difference]: With dead ends: 13201 [2022-03-03 18:27:21,153 INFO L226 Difference]: Without dead ends: 13201 [2022-03-03 18:27:21,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=633, Unknown=0, NotChecked=0, Total=870 [2022-03-03 18:27:21,154 INFO L933 BasicCegarLoop]: 672 mSDtfsCounter, 722 mSDsluCounter, 2794 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 3462 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:21,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 3462 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:27:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13201 states. [2022-03-03 18:27:21,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13201 to 12755. [2022-03-03 18:27:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12755 states, 12689 states have (on average 1.976042241311372) internal successors, (25074), 12754 states have internal predecessors, (25074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12755 states to 12755 states and 25074 transitions. [2022-03-03 18:27:21,308 INFO L78 Accepts]: Start accepts. Automaton has 12755 states and 25074 transitions. Word has length 484 [2022-03-03 18:27:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:21,308 INFO L470 AbstractCegarLoop]: Abstraction has 12755 states and 25074 transitions. [2022-03-03 18:27:21,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:21,308 INFO L276 IsEmpty]: Start isEmpty. Operand 12755 states and 25074 transitions. [2022-03-03 18:27:21,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:21,311 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:21,311 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:21,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-03 18:27:21,311 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:21,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:21,312 INFO L85 PathProgramCache]: Analyzing trace with hash -283118668, now seen corresponding path program 7 times [2022-03-03 18:27:21,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:21,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909780071] [2022-03-03 18:27:21,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:21,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:21,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:21,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909780071] [2022-03-03 18:27:21,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909780071] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:21,520 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:21,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:21,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538621029] [2022-03-03 18:27:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:21,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:21,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:21,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:21,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:21,521 INFO L87 Difference]: Start difference. First operand 12755 states and 25074 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:22,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:22,976 INFO L93 Difference]: Finished difference Result 23707 states and 46979 transitions. [2022-03-03 18:27:22,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-03 18:27:22,976 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:23,012 INFO L225 Difference]: With dead ends: 23707 [2022-03-03 18:27:23,013 INFO L226 Difference]: Without dead ends: 23707 [2022-03-03 18:27:23,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2022-03-03 18:27:23,013 INFO L933 BasicCegarLoop]: 798 mSDtfsCounter, 1339 mSDsluCounter, 3559 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 4354 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:23,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1339 Valid, 4354 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:27:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23707 states. [2022-03-03 18:27:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23707 to 12962. [2022-03-03 18:27:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12962 states, 12896 states have (on average 1.9764267990074442) internal successors, (25488), 12961 states have internal predecessors, (25488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 25488 transitions. [2022-03-03 18:27:23,345 INFO L78 Accepts]: Start accepts. Automaton has 12962 states and 25488 transitions. Word has length 484 [2022-03-03 18:27:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:23,345 INFO L470 AbstractCegarLoop]: Abstraction has 12962 states and 25488 transitions. [2022-03-03 18:27:23,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 12962 states and 25488 transitions. [2022-03-03 18:27:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:23,348 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:23,348 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:23,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-03-03 18:27:23,348 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:23,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:23,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2091267574, now seen corresponding path program 1 times [2022-03-03 18:27:23,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:23,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348176119] [2022-03-03 18:27:23,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:23,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:23,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:23,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:23,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348176119] [2022-03-03 18:27:23,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348176119] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:23,587 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:23,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:23,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729962673] [2022-03-03 18:27:23,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:23,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:23,588 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:23,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:23,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:23,588 INFO L87 Difference]: Start difference. First operand 12962 states and 25488 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:25,105 INFO L93 Difference]: Finished difference Result 23598 states and 46761 transitions. [2022-03-03 18:27:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-03 18:27:25,106 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:25,138 INFO L225 Difference]: With dead ends: 23598 [2022-03-03 18:27:25,138 INFO L226 Difference]: Without dead ends: 23598 [2022-03-03 18:27:25,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=1111, Unknown=0, NotChecked=0, Total=1406 [2022-03-03 18:27:25,139 INFO L933 BasicCegarLoop]: 805 mSDtfsCounter, 1413 mSDsluCounter, 3194 mSDsCounter, 0 mSdLazyCounter, 2576 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 3998 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:25,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1413 Valid, 3998 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2576 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:27:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23598 states. [2022-03-03 18:27:25,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23598 to 12954. [2022-03-03 18:27:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12954 states, 12889 states have (on average 1.9762588253549538) internal successors, (25472), 12953 states have internal predecessors, (25472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12954 states to 12954 states and 25472 transitions. [2022-03-03 18:27:25,350 INFO L78 Accepts]: Start accepts. Automaton has 12954 states and 25472 transitions. Word has length 484 [2022-03-03 18:27:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:25,350 INFO L470 AbstractCegarLoop]: Abstraction has 12954 states and 25472 transitions. [2022-03-03 18:27:25,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 12954 states and 25472 transitions. [2022-03-03 18:27:25,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:25,353 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:25,353 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:25,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-03-03 18:27:25,354 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:25,354 INFO L85 PathProgramCache]: Analyzing trace with hash -750198022, now seen corresponding path program 2 times [2022-03-03 18:27:25,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:25,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239857161] [2022-03-03 18:27:25,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:25,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:25,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:25,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239857161] [2022-03-03 18:27:25,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239857161] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:25,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:25,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:25,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327479982] [2022-03-03 18:27:25,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:25,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:25,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:25,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:25,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:25,587 INFO L87 Difference]: Start difference. First operand 12954 states and 25472 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:26,957 INFO L93 Difference]: Finished difference Result 24018 states and 47600 transitions. [2022-03-03 18:27:26,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-03 18:27:26,957 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:26,995 INFO L225 Difference]: With dead ends: 24018 [2022-03-03 18:27:26,996 INFO L226 Difference]: Without dead ends: 24018 [2022-03-03 18:27:26,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2022-03-03 18:27:26,996 INFO L933 BasicCegarLoop]: 715 mSDtfsCounter, 913 mSDsluCounter, 3527 mSDsCounter, 0 mSdLazyCounter, 2685 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:26,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 4241 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2685 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:27:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24018 states. [2022-03-03 18:27:27,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24018 to 13195. [2022-03-03 18:27:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13195 states, 13130 states have (on average 1.9766945925361767) internal successors, (25954), 13194 states have internal predecessors, (25954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13195 states to 13195 states and 25954 transitions. [2022-03-03 18:27:27,260 INFO L78 Accepts]: Start accepts. Automaton has 13195 states and 25954 transitions. Word has length 484 [2022-03-03 18:27:27,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:27,260 INFO L470 AbstractCegarLoop]: Abstraction has 13195 states and 25954 transitions. [2022-03-03 18:27:27,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:27,260 INFO L276 IsEmpty]: Start isEmpty. Operand 13195 states and 25954 transitions. [2022-03-03 18:27:27,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:27,264 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:27,264 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:27,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-03-03 18:27:27,264 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:27,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:27,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1102524194, now seen corresponding path program 3 times [2022-03-03 18:27:27,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:27,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014213933] [2022-03-03 18:27:27,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:27,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:27,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:27,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014213933] [2022-03-03 18:27:27,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014213933] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:27,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:27,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:27,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025481005] [2022-03-03 18:27:27,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:27,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:27,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:27,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:27,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:27,569 INFO L87 Difference]: Start difference. First operand 13195 states and 25954 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:28,401 INFO L93 Difference]: Finished difference Result 13507 states and 26578 transitions. [2022-03-03 18:27:28,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:27:28,401 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:28,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:28,418 INFO L225 Difference]: With dead ends: 13507 [2022-03-03 18:27:28,418 INFO L226 Difference]: Without dead ends: 13507 [2022-03-03 18:27:28,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-03 18:27:28,419 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 304 mSDsluCounter, 2265 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:28,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 2672 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:27:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13507 states. [2022-03-03 18:27:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13507 to 13199. [2022-03-03 18:27:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-03 18:27:28,576 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-03 18:27:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:28,577 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-03 18:27:28,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-03 18:27:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:28,580 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:28,580 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:28,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-03-03 18:27:28,580 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:28,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1981616688, now seen corresponding path program 4 times [2022-03-03 18:27:28,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:28,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210299012] [2022-03-03 18:27:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:28,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:28,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:28,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210299012] [2022-03-03 18:27:28,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210299012] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:28,829 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:28,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:28,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141969871] [2022-03-03 18:27:28,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:28,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:28,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:28,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:28,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:28,830 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:29,524 INFO L93 Difference]: Finished difference Result 13561 states and 26686 transitions. [2022-03-03 18:27:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:27:29,525 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:29,540 INFO L225 Difference]: With dead ends: 13561 [2022-03-03 18:27:29,540 INFO L226 Difference]: Without dead ends: 13561 [2022-03-03 18:27:29,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:27:29,541 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 333 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:29,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 2252 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:27:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13561 states. [2022-03-03 18:27:29,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13561 to 13199. [2022-03-03 18:27:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-03 18:27:29,699 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-03 18:27:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:29,700 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-03 18:27:29,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-03 18:27:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:29,703 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:29,703 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:29,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-03-03 18:27:29,704 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:29,704 INFO L85 PathProgramCache]: Analyzing trace with hash 24019584, now seen corresponding path program 5 times [2022-03-03 18:27:29,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:29,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101181161] [2022-03-03 18:27:29,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:29,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:30,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:30,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101181161] [2022-03-03 18:27:30,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101181161] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:30,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:30,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:30,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526251341] [2022-03-03 18:27:30,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:30,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:30,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:30,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:30,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:30,038 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:31,013 INFO L93 Difference]: Finished difference Result 13609 states and 26782 transitions. [2022-03-03 18:27:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:27:31,014 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:31,034 INFO L225 Difference]: With dead ends: 13609 [2022-03-03 18:27:31,034 INFO L226 Difference]: Without dead ends: 13609 [2022-03-03 18:27:31,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:27:31,034 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 332 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:31,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 2810 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1789 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 18:27:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13609 states. [2022-03-03 18:27:31,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13609 to 13199. [2022-03-03 18:27:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-03 18:27:31,222 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-03 18:27:31,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:31,222 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-03 18:27:31,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-03 18:27:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:31,226 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:31,226 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:31,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-03-03 18:27:31,226 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:31,227 INFO L85 PathProgramCache]: Analyzing trace with hash 212754002, now seen corresponding path program 6 times [2022-03-03 18:27:31,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:31,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620237875] [2022-03-03 18:27:31,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:31,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:31,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:31,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620237875] [2022-03-03 18:27:31,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620237875] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:31,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:31,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:31,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672667745] [2022-03-03 18:27:31,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:31,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:31,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:31,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:31,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:31,530 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:32,335 INFO L93 Difference]: Finished difference Result 13663 states and 26890 transitions. [2022-03-03 18:27:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:27:32,335 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:32,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:32,355 INFO L225 Difference]: With dead ends: 13663 [2022-03-03 18:27:32,355 INFO L226 Difference]: Without dead ends: 13663 [2022-03-03 18:27:32,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:27:32,356 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 360 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:32,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 2303 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:27:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13663 states. [2022-03-03 18:27:32,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13663 to 13199. [2022-03-03 18:27:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-03 18:27:32,539 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-03 18:27:32,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:32,539 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-03 18:27:32,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-03 18:27:32,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:32,543 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:32,543 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:32,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-03-03 18:27:32,543 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:32,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:32,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1227423530, now seen corresponding path program 8 times [2022-03-03 18:27:32,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:32,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910869523] [2022-03-03 18:27:32,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:32,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:32,796 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:32,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910869523] [2022-03-03 18:27:32,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910869523] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:32,796 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:32,796 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:32,796 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343583498] [2022-03-03 18:27:32,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:32,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:32,797 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:32,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:32,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:32,797 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:34,312 INFO L93 Difference]: Finished difference Result 23784 states and 47132 transitions. [2022-03-03 18:27:34,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:27:34,313 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:34,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:34,347 INFO L225 Difference]: With dead ends: 23784 [2022-03-03 18:27:34,347 INFO L226 Difference]: Without dead ends: 23784 [2022-03-03 18:27:34,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:27:34,347 INFO L933 BasicCegarLoop]: 841 mSDtfsCounter, 765 mSDsluCounter, 3969 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 4807 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:34,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 4807 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2936 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:27:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23784 states. [2022-03-03 18:27:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23784 to 12971. [2022-03-03 18:27:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12906 states have (on average 1.9762900976290099) internal successors, (25506), 12970 states have internal predecessors, (25506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-03 18:27:34,588 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-03 18:27:34,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:34,589 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-03 18:27:34,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-03 18:27:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:34,592 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:34,592 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:34,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-03-03 18:27:34,592 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:34,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:34,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2081387342, now seen corresponding path program 7 times [2022-03-03 18:27:34,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:34,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273229028] [2022-03-03 18:27:34,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:34,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:34,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:34,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273229028] [2022-03-03 18:27:34,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273229028] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:34,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:34,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:34,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299756645] [2022-03-03 18:27:34,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:34,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:34,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:34,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:34,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:34,847 INFO L87 Difference]: Start difference. First operand 12971 states and 25506 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:36,438 INFO L93 Difference]: Finished difference Result 23965 states and 47494 transitions. [2022-03-03 18:27:36,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-03 18:27:36,439 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:36,475 INFO L225 Difference]: With dead ends: 23965 [2022-03-03 18:27:36,476 INFO L226 Difference]: Without dead ends: 23965 [2022-03-03 18:27:36,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2022-03-03 18:27:36,476 INFO L933 BasicCegarLoop]: 810 mSDtfsCounter, 966 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 3025 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 4774 SdHoareTripleChecker+Invalid, 3076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:36,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [966 Valid, 4774 Invalid, 3076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3025 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 18:27:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23965 states. [2022-03-03 18:27:36,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23965 to 13214. [2022-03-03 18:27:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13149 states have (on average 1.9767282683093772) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-03 18:27:36,724 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-03 18:27:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:36,725 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-03 18:27:36,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-03 18:27:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:36,728 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:36,728 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:36,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-03-03 18:27:36,729 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:36,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1475024146, now seen corresponding path program 9 times [2022-03-03 18:27:36,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:36,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150205723] [2022-03-03 18:27:36,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:36,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:36,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:36,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150205723] [2022-03-03 18:27:36,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150205723] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:36,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:36,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:36,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168560003] [2022-03-03 18:27:36,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:36,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:36,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:36,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:36,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:36,955 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:38,544 INFO L93 Difference]: Finished difference Result 23857 states and 47278 transitions. [2022-03-03 18:27:38,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-03 18:27:38,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:38,582 INFO L225 Difference]: With dead ends: 23857 [2022-03-03 18:27:38,582 INFO L226 Difference]: Without dead ends: 23857 [2022-03-03 18:27:38,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2022-03-03 18:27:38,582 INFO L933 BasicCegarLoop]: 939 mSDtfsCounter, 816 mSDsluCounter, 4164 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 5100 SdHoareTripleChecker+Invalid, 3071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:38,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [816 Valid, 5100 Invalid, 3071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:27:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23857 states. [2022-03-03 18:27:38,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23857 to 12971. [2022-03-03 18:27:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12906 states have (on average 1.9762900976290099) internal successors, (25506), 12970 states have internal predecessors, (25506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-03 18:27:38,829 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-03 18:27:38,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:38,829 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-03 18:27:38,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:38,829 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-03 18:27:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:38,832 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:38,832 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:38,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-03-03 18:27:38,833 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:38,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1894926820, now seen corresponding path program 8 times [2022-03-03 18:27:38,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:38,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649274885] [2022-03-03 18:27:38,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:39,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:39,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649274885] [2022-03-03 18:27:39,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649274885] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:39,074 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:39,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:39,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40492129] [2022-03-03 18:27:39,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:39,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:39,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:39,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:39,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:39,075 INFO L87 Difference]: Start difference. First operand 12971 states and 25506 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:40,438 INFO L93 Difference]: Finished difference Result 25380 states and 50259 transitions. [2022-03-03 18:27:40,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:27:40,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:40,480 INFO L225 Difference]: With dead ends: 25380 [2022-03-03 18:27:40,480 INFO L226 Difference]: Without dead ends: 25380 [2022-03-03 18:27:40,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2022-03-03 18:27:40,481 INFO L933 BasicCegarLoop]: 918 mSDtfsCounter, 1399 mSDsluCounter, 3268 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 4186 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:40,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1399 Valid, 4186 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:27:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25380 states. [2022-03-03 18:27:40,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25380 to 14569. [2022-03-03 18:27:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14569 states, 14504 states have (on average 1.993656922228351) internal successors, (28916), 14568 states have internal predecessors, (28916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14569 states to 14569 states and 28916 transitions. [2022-03-03 18:27:40,749 INFO L78 Accepts]: Start accepts. Automaton has 14569 states and 28916 transitions. Word has length 484 [2022-03-03 18:27:40,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:40,750 INFO L470 AbstractCegarLoop]: Abstraction has 14569 states and 28916 transitions. [2022-03-03 18:27:40,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 14569 states and 28916 transitions. [2022-03-03 18:27:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:40,753 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:40,753 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:40,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-03-03 18:27:40,754 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:40,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash -547318260, now seen corresponding path program 9 times [2022-03-03 18:27:40,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:40,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719406082] [2022-03-03 18:27:40,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:40,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:41,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:41,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719406082] [2022-03-03 18:27:41,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719406082] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:41,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:41,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:41,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442896450] [2022-03-03 18:27:41,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:41,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:41,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:41,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:41,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:41,026 INFO L87 Difference]: Start difference. First operand 14569 states and 28916 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:41,989 INFO L93 Difference]: Finished difference Result 16297 states and 32307 transitions. [2022-03-03 18:27:41,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:27:41,990 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:42,015 INFO L225 Difference]: With dead ends: 16297 [2022-03-03 18:27:42,015 INFO L226 Difference]: Without dead ends: 16297 [2022-03-03 18:27:42,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:27:42,016 INFO L933 BasicCegarLoop]: 613 mSDtfsCounter, 574 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:42,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 3050 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 18:27:42,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16297 states. [2022-03-03 18:27:42,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16297 to 14572. [2022-03-03 18:27:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14572 states, 14507 states have (on average 1.9936582339560212) internal successors, (28922), 14571 states have internal predecessors, (28922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 28922 transitions. [2022-03-03 18:27:42,227 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 28922 transitions. Word has length 484 [2022-03-03 18:27:42,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:42,228 INFO L470 AbstractCegarLoop]: Abstraction has 14572 states and 28922 transitions. [2022-03-03 18:27:42,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 28922 transitions. [2022-03-03 18:27:42,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:42,231 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:42,232 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:42,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-03-03 18:27:42,232 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:42,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:42,232 INFO L85 PathProgramCache]: Analyzing trace with hash 331774234, now seen corresponding path program 10 times [2022-03-03 18:27:42,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:42,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436993635] [2022-03-03 18:27:42,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:42,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:42,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:42,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436993635] [2022-03-03 18:27:42,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436993635] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:42,512 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:42,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:42,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984810910] [2022-03-03 18:27:42,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:42,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:42,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:42,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:42,513 INFO L87 Difference]: Start difference. First operand 14572 states and 28922 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:43,658 INFO L93 Difference]: Finished difference Result 16351 states and 32415 transitions. [2022-03-03 18:27:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:27:43,658 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:43,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:43,682 INFO L225 Difference]: With dead ends: 16351 [2022-03-03 18:27:43,683 INFO L226 Difference]: Without dead ends: 16351 [2022-03-03 18:27:43,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:27:43,683 INFO L933 BasicCegarLoop]: 621 mSDtfsCounter, 601 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 3454 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:43,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 3454 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:27:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16351 states. [2022-03-03 18:27:43,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16351 to 14571. [2022-03-03 18:27:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14571 states, 14506 states have (on average 1.9936577967737488) internal successors, (28920), 14570 states have internal predecessors, (28920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14571 states to 14571 states and 28920 transitions. [2022-03-03 18:27:43,891 INFO L78 Accepts]: Start accepts. Automaton has 14571 states and 28920 transitions. Word has length 484 [2022-03-03 18:27:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:43,891 INFO L470 AbstractCegarLoop]: Abstraction has 14571 states and 28920 transitions. [2022-03-03 18:27:43,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 14571 states and 28920 transitions. [2022-03-03 18:27:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:43,895 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:43,895 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:43,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-03-03 18:27:43,895 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:43,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:43,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1625822870, now seen corresponding path program 11 times [2022-03-03 18:27:43,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:43,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464822484] [2022-03-03 18:27:43,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:43,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:44,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:44,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464822484] [2022-03-03 18:27:44,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464822484] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:44,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:44,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:44,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591680411] [2022-03-03 18:27:44,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:44,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:44,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:44,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:44,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:44,154 INFO L87 Difference]: Start difference. First operand 14571 states and 28920 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:45,076 INFO L93 Difference]: Finished difference Result 16399 states and 32511 transitions. [2022-03-03 18:27:45,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:27:45,076 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:45,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:45,094 INFO L225 Difference]: With dead ends: 16399 [2022-03-03 18:27:45,094 INFO L226 Difference]: Without dead ends: 16399 [2022-03-03 18:27:45,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2022-03-03 18:27:45,095 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 616 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:45,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 2788 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:27:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16399 states. [2022-03-03 18:27:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16399 to 14570. [2022-03-03 18:27:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14570 states, 14505 states have (on average 1.9936573595311962) internal successors, (28918), 14569 states have internal predecessors, (28918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 28918 transitions. [2022-03-03 18:27:45,279 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 28918 transitions. Word has length 484 [2022-03-03 18:27:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:45,279 INFO L470 AbstractCegarLoop]: Abstraction has 14570 states and 28918 transitions. [2022-03-03 18:27:45,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:45,279 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 28918 transitions. [2022-03-03 18:27:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:45,283 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:45,283 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:45,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-03-03 18:27:45,283 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:45,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1437088452, now seen corresponding path program 12 times [2022-03-03 18:27:45,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:45,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748767892] [2022-03-03 18:27:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:45,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:45,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748767892] [2022-03-03 18:27:45,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748767892] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:45,523 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:45,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:45,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357915647] [2022-03-03 18:27:45,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:45,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:45,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:45,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:45,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:45,524 INFO L87 Difference]: Start difference. First operand 14570 states and 28918 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:46,404 INFO L93 Difference]: Finished difference Result 16449 states and 32611 transitions. [2022-03-03 18:27:46,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-03 18:27:46,404 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:46,430 INFO L225 Difference]: With dead ends: 16449 [2022-03-03 18:27:46,430 INFO L226 Difference]: Without dead ends: 16449 [2022-03-03 18:27:46,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-03-03 18:27:46,431 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 629 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:46,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 2795 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-03 18:27:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16449 states. [2022-03-03 18:27:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16449 to 14570. [2022-03-03 18:27:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14570 states, 14505 states have (on average 1.9936573595311962) internal successors, (28918), 14569 states have internal predecessors, (28918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 28918 transitions. [2022-03-03 18:27:46,666 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 28918 transitions. Word has length 484 [2022-03-03 18:27:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:46,667 INFO L470 AbstractCegarLoop]: Abstraction has 14570 states and 28918 transitions. [2022-03-03 18:27:46,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 28918 transitions. [2022-03-03 18:27:46,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:46,670 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:46,671 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:46,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-03-03 18:27:46,671 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:46,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:46,671 INFO L85 PathProgramCache]: Analyzing trace with hash 228339840, now seen corresponding path program 13 times [2022-03-03 18:27:46,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:46,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581961433] [2022-03-03 18:27:46,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:46,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:46,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:46,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581961433] [2022-03-03 18:27:46,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581961433] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:46,957 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:46,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:46,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688347038] [2022-03-03 18:27:46,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:46,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:46,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:46,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:46,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:46,958 INFO L87 Difference]: Start difference. First operand 14570 states and 28918 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:48,535 INFO L93 Difference]: Finished difference Result 16314 states and 32340 transitions. [2022-03-03 18:27:48,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-03 18:27:48,535 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:48,627 INFO L225 Difference]: With dead ends: 16314 [2022-03-03 18:27:48,627 INFO L226 Difference]: Without dead ends: 16314 [2022-03-03 18:27:48,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-03-03 18:27:48,627 INFO L933 BasicCegarLoop]: 730 mSDtfsCounter, 722 mSDsluCounter, 3279 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 4009 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:48,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 4009 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 18:27:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16314 states. [2022-03-03 18:27:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16314 to 14555. [2022-03-03 18:27:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14555 states, 14490 states have (on average 1.9935127674258108) internal successors, (28886), 14554 states have internal predecessors, (28886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14555 states to 14555 states and 28886 transitions. [2022-03-03 18:27:48,803 INFO L78 Accepts]: Start accepts. Automaton has 14555 states and 28886 transitions. Word has length 484 [2022-03-03 18:27:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:48,804 INFO L470 AbstractCegarLoop]: Abstraction has 14555 states and 28886 transitions. [2022-03-03 18:27:48,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 14555 states and 28886 transitions. [2022-03-03 18:27:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:48,808 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:48,808 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:48,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-03-03 18:27:48,809 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1334381400, now seen corresponding path program 14 times [2022-03-03 18:27:48,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:48,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778674253] [2022-03-03 18:27:48,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:48,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:49,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:49,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778674253] [2022-03-03 18:27:49,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778674253] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:49,107 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:49,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:49,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272432671] [2022-03-03 18:27:49,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:49,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:49,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:49,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:49,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:49,108 INFO L87 Difference]: Start difference. First operand 14555 states and 28886 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:50,839 INFO L93 Difference]: Finished difference Result 16306 states and 32322 transitions. [2022-03-03 18:27:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:27:50,839 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:50,864 INFO L225 Difference]: With dead ends: 16306 [2022-03-03 18:27:50,864 INFO L226 Difference]: Without dead ends: 16306 [2022-03-03 18:27:50,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-03-03 18:27:50,865 INFO L933 BasicCegarLoop]: 731 mSDtfsCounter, 721 mSDsluCounter, 3367 mSDsCounter, 0 mSdLazyCounter, 3163 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 4098 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:50,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 4098 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3163 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 18:27:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16306 states. [2022-03-03 18:27:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16306 to 14556. [2022-03-03 18:27:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14556 states, 14491 states have (on average 1.993513215099027) internal successors, (28888), 14555 states have internal predecessors, (28888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14556 states to 14556 states and 28888 transitions. [2022-03-03 18:27:51,086 INFO L78 Accepts]: Start accepts. Automaton has 14556 states and 28888 transitions. Word has length 484 [2022-03-03 18:27:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:51,087 INFO L470 AbstractCegarLoop]: Abstraction has 14556 states and 28888 transitions. [2022-03-03 18:27:51,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 14556 states and 28888 transitions. [2022-03-03 18:27:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:51,090 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:51,090 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:51,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-03-03 18:27:51,090 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:51,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2081493402, now seen corresponding path program 15 times [2022-03-03 18:27:51,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:51,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183735927] [2022-03-03 18:27:51,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:51,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:51,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183735927] [2022-03-03 18:27:51,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183735927] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:51,338 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:51,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:51,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464548442] [2022-03-03 18:27:51,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:51,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:51,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:51,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:51,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:51,339 INFO L87 Difference]: Start difference. First operand 14556 states and 28888 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:53,170 INFO L93 Difference]: Finished difference Result 16359 states and 32428 transitions. [2022-03-03 18:27:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:27:53,171 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:53,193 INFO L225 Difference]: With dead ends: 16359 [2022-03-03 18:27:53,193 INFO L226 Difference]: Without dead ends: 16359 [2022-03-03 18:27:53,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:27:53,194 INFO L933 BasicCegarLoop]: 738 mSDtfsCounter, 734 mSDsluCounter, 3553 mSDsCounter, 0 mSdLazyCounter, 3383 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 4291 SdHoareTripleChecker+Invalid, 3436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:53,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [734 Valid, 4291 Invalid, 3436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3383 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-03 18:27:53,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16359 states. [2022-03-03 18:27:53,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16359 to 14540. [2022-03-03 18:27:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14540 states, 14475 states have (on average 1.9933678756476685) internal successors, (28854), 14539 states have internal predecessors, (28854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14540 states to 14540 states and 28854 transitions. [2022-03-03 18:27:53,389 INFO L78 Accepts]: Start accepts. Automaton has 14540 states and 28854 transitions. Word has length 484 [2022-03-03 18:27:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:53,390 INFO L470 AbstractCegarLoop]: Abstraction has 14540 states and 28854 transitions. [2022-03-03 18:27:53,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 14540 states and 28854 transitions. [2022-03-03 18:27:53,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:53,393 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:53,393 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:53,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-03-03 18:27:53,394 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:53,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2006633890, now seen corresponding path program 16 times [2022-03-03 18:27:53,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:53,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805635965] [2022-03-03 18:27:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:53,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:53,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:53,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805635965] [2022-03-03 18:27:53,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805635965] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:53,647 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:53,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:53,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576281747] [2022-03-03 18:27:53,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:53,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:53,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:53,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:53,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:53,648 INFO L87 Difference]: Start difference. First operand 14540 states and 28854 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:54,710 INFO L93 Difference]: Finished difference Result 16300 states and 32309 transitions. [2022-03-03 18:27:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:27:54,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:54,738 INFO L225 Difference]: With dead ends: 16300 [2022-03-03 18:27:54,739 INFO L226 Difference]: Without dead ends: 16300 [2022-03-03 18:27:54,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:27:54,739 INFO L933 BasicCegarLoop]: 662 mSDtfsCounter, 659 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2864 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:54,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [659 Valid, 2864 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:27:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16300 states. [2022-03-03 18:27:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16300 to 14542. [2022-03-03 18:27:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14542 states, 14477 states have (on average 1.99336879187677) internal successors, (28858), 14541 states have internal predecessors, (28858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14542 states to 14542 states and 28858 transitions. [2022-03-03 18:27:54,929 INFO L78 Accepts]: Start accepts. Automaton has 14542 states and 28858 transitions. Word has length 484 [2022-03-03 18:27:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:54,929 INFO L470 AbstractCegarLoop]: Abstraction has 14542 states and 28858 transitions. [2022-03-03 18:27:54,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 14542 states and 28858 transitions. [2022-03-03 18:27:54,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:54,933 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:54,933 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:54,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-03-03 18:27:54,933 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:54,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:54,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1409240912, now seen corresponding path program 17 times [2022-03-03 18:27:54,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:54,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154255056] [2022-03-03 18:27:54,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:54,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:55,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:55,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154255056] [2022-03-03 18:27:55,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154255056] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:55,227 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:55,227 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:55,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380918276] [2022-03-03 18:27:55,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:55,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:55,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:55,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:55,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:55,228 INFO L87 Difference]: Start difference. First operand 14542 states and 28858 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:56,644 INFO L93 Difference]: Finished difference Result 16358 states and 32425 transitions. [2022-03-03 18:27:56,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:27:56,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:56,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:56,667 INFO L225 Difference]: With dead ends: 16358 [2022-03-03 18:27:56,667 INFO L226 Difference]: Without dead ends: 16358 [2022-03-03 18:27:56,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-03 18:27:56,668 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 664 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 3416 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:56,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [664 Valid, 3416 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:27:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16358 states. [2022-03-03 18:27:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16358 to 14541. [2022-03-03 18:27:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14541 states, 14476 states have (on average 1.9933683337938657) internal successors, (28856), 14540 states have internal predecessors, (28856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14541 states to 14541 states and 28856 transitions. [2022-03-03 18:27:56,864 INFO L78 Accepts]: Start accepts. Automaton has 14541 states and 28856 transitions. Word has length 484 [2022-03-03 18:27:56,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:56,864 INFO L470 AbstractCegarLoop]: Abstraction has 14541 states and 28856 transitions. [2022-03-03 18:27:56,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:56,864 INFO L276 IsEmpty]: Start isEmpty. Operand 14541 states and 28856 transitions. [2022-03-03 18:27:56,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:56,869 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:56,869 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:56,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-03-03 18:27:56,869 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:56,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:56,870 INFO L85 PathProgramCache]: Analyzing trace with hash 928129280, now seen corresponding path program 18 times [2022-03-03 18:27:56,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:56,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180079887] [2022-03-03 18:27:56,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:56,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:57,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:57,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180079887] [2022-03-03 18:27:57,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180079887] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:57,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:57,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:57,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222348807] [2022-03-03 18:27:57,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:57,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:57,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:57,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:57,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:57,118 INFO L87 Difference]: Start difference. First operand 14541 states and 28856 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:27:58,705 INFO L93 Difference]: Finished difference Result 16443 states and 32595 transitions. [2022-03-03 18:27:58,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:27:58,706 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:27:58,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:27:58,728 INFO L225 Difference]: With dead ends: 16443 [2022-03-03 18:27:58,728 INFO L226 Difference]: Without dead ends: 16443 [2022-03-03 18:27:58,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:27:58,728 INFO L933 BasicCegarLoop]: 677 mSDtfsCounter, 675 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 3881 SdHoareTripleChecker+Invalid, 3029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:27:58,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [675 Valid, 3881 Invalid, 3029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2956 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 18:27:58,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16443 states. [2022-03-03 18:27:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16443 to 13214. [2022-03-03 18:27:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13149 states have (on average 1.9767282683093772) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:58,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-03 18:27:58,906 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-03 18:27:58,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:27:58,907 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-03 18:27:58,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:27:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-03 18:27:58,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:27:58,910 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:27:58,910 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:27:58,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-03-03 18:27:58,910 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:27:58,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:27:58,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1312401738, now seen corresponding path program 19 times [2022-03-03 18:27:58,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:27:58,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210422399] [2022-03-03 18:27:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:27:58,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:27:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:27:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:27:59,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:27:59,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210422399] [2022-03-03 18:27:59,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210422399] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:27:59,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:27:59,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:27:59,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559466622] [2022-03-03 18:27:59,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:27:59,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:27:59,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:27:59,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:27:59,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:27:59,196 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:00,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:00,541 INFO L93 Difference]: Finished difference Result 14947 states and 29393 transitions. [2022-03-03 18:28:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 18:28:00,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:28:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:00,561 INFO L225 Difference]: With dead ends: 14947 [2022-03-03 18:28:00,562 INFO L226 Difference]: Without dead ends: 14947 [2022-03-03 18:28:00,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:28:00,562 INFO L933 BasicCegarLoop]: 605 mSDtfsCounter, 572 mSDsluCounter, 2948 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 3553 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:00,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 3553 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:28:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14947 states. [2022-03-03 18:28:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14947 to 13217. [2022-03-03 18:28:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13217 states, 13152 states have (on average 1.9767335766423357) internal successors, (25998), 13216 states have internal predecessors, (25998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13217 states to 13217 states and 25998 transitions. [2022-03-03 18:28:00,744 INFO L78 Accepts]: Start accepts. Automaton has 13217 states and 25998 transitions. Word has length 484 [2022-03-03 18:28:00,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:00,744 INFO L470 AbstractCegarLoop]: Abstraction has 13217 states and 25998 transitions. [2022-03-03 18:28:00,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 13217 states and 25998 transitions. [2022-03-03 18:28:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:28:00,748 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:00,748 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:00,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-03-03 18:28:00,748 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:00,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:00,748 INFO L85 PathProgramCache]: Analyzing trace with hash -433309244, now seen corresponding path program 20 times [2022-03-03 18:28:00,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:00,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562978068] [2022-03-03 18:28:00,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:00,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:01,018 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:01,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562978068] [2022-03-03 18:28:01,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562978068] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:01,018 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:28:01,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:28:01,019 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342534474] [2022-03-03 18:28:01,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:01,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:28:01,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:01,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:28:01,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:28:01,020 INFO L87 Difference]: Start difference. First operand 13217 states and 25998 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:02,055 INFO L93 Difference]: Finished difference Result 15001 states and 29501 transitions. [2022-03-03 18:28:02,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:28:02,056 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:28:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:02,075 INFO L225 Difference]: With dead ends: 15001 [2022-03-03 18:28:02,075 INFO L226 Difference]: Without dead ends: 15001 [2022-03-03 18:28:02,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-03 18:28:02,076 INFO L933 BasicCegarLoop]: 612 mSDtfsCounter, 589 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:02,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 2837 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:28:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15001 states. [2022-03-03 18:28:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15001 to 13216. [2022-03-03 18:28:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13216 states, 13151 states have (on average 1.9767318074671127) internal successors, (25996), 13215 states have internal predecessors, (25996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13216 states to 13216 states and 25996 transitions. [2022-03-03 18:28:02,248 INFO L78 Accepts]: Start accepts. Automaton has 13216 states and 25996 transitions. Word has length 484 [2022-03-03 18:28:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:02,248 INFO L470 AbstractCegarLoop]: Abstraction has 13216 states and 25996 transitions. [2022-03-03 18:28:02,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 13216 states and 25996 transitions. [2022-03-03 18:28:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:28:02,252 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:02,252 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:02,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-03-03 18:28:02,252 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:02,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:02,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1904060948, now seen corresponding path program 21 times [2022-03-03 18:28:02,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:02,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932413759] [2022-03-03 18:28:02,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:02,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:02,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:02,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932413759] [2022-03-03 18:28:02,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932413759] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:02,515 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:28:02,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:28:02,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014864301] [2022-03-03 18:28:02,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:02,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:28:02,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:02,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:28:02,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:28:02,516 INFO L87 Difference]: Start difference. First operand 13216 states and 25996 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:03,531 INFO L93 Difference]: Finished difference Result 15052 states and 29603 transitions. [2022-03-03 18:28:03,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:28:03,532 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:28:03,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:03,552 INFO L225 Difference]: With dead ends: 15052 [2022-03-03 18:28:03,552 INFO L226 Difference]: Without dead ends: 15052 [2022-03-03 18:28:03,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2022-03-03 18:28:03,619 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 602 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:03,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 2695 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-03 18:28:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15052 states. [2022-03-03 18:28:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15052 to 13215. [2022-03-03 18:28:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13215 states, 13150 states have (on average 1.9767300380228137) internal successors, (25994), 13214 states have internal predecessors, (25994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13215 states to 13215 states and 25994 transitions. [2022-03-03 18:28:03,803 INFO L78 Accepts]: Start accepts. Automaton has 13215 states and 25994 transitions. Word has length 484 [2022-03-03 18:28:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:03,803 INFO L470 AbstractCegarLoop]: Abstraction has 13215 states and 25994 transitions. [2022-03-03 18:28:03,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 13215 states and 25994 transitions. [2022-03-03 18:28:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:28:03,807 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:03,807 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:03,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-03-03 18:28:03,807 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:03,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:03,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2092795366, now seen corresponding path program 22 times [2022-03-03 18:28:03,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:03,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070717784] [2022-03-03 18:28:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:03,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:04,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:04,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070717784] [2022-03-03 18:28:04,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070717784] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:04,047 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:28:04,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:28:04,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576945165] [2022-03-03 18:28:04,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:04,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:28:04,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:04,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:28:04,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:28:04,047 INFO L87 Difference]: Start difference. First operand 13215 states and 25994 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:05,409 INFO L93 Difference]: Finished difference Result 15095 states and 29689 transitions. [2022-03-03 18:28:05,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:28:05,409 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:28:05,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:05,430 INFO L225 Difference]: With dead ends: 15095 [2022-03-03 18:28:05,430 INFO L226 Difference]: Without dead ends: 15095 [2022-03-03 18:28:05,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:28:05,431 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 623 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 2654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:05,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 3466 Invalid, 2654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:28:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15095 states. [2022-03-03 18:28:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15095 to 13214. [2022-03-03 18:28:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13149 states have (on average 1.9767282683093772) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-03 18:28:05,593 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-03 18:28:05,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:05,593 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-03 18:28:05,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-03 18:28:05,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:28:05,596 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:05,597 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:05,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-03-03 18:28:05,597 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:05,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:05,597 INFO L85 PathProgramCache]: Analyzing trace with hash 418435456, now seen corresponding path program 10 times [2022-03-03 18:28:05,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:05,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681150203] [2022-03-03 18:28:05,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:05,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:05,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:05,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681150203] [2022-03-03 18:28:05,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681150203] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:05,814 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:28:05,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:28:05,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473324734] [2022-03-03 18:28:05,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:05,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:28:05,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:05,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:28:05,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:28:05,815 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:07,531 INFO L93 Difference]: Finished difference Result 25238 states and 49975 transitions. [2022-03-03 18:28:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-03 18:28:07,531 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:28:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:07,568 INFO L225 Difference]: With dead ends: 25238 [2022-03-03 18:28:07,568 INFO L226 Difference]: Without dead ends: 25238 [2022-03-03 18:28:07,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2022-03-03 18:28:07,568 INFO L933 BasicCegarLoop]: 1059 mSDtfsCounter, 1188 mSDsluCounter, 4442 mSDsCounter, 0 mSdLazyCounter, 2967 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 3039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:07,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1188 Valid, 5500 Invalid, 3039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2967 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:28:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25238 states. [2022-03-03 18:28:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25238 to 12987. [2022-03-03 18:28:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12987 states, 12923 states have (on average 1.976166524800743) internal successors, (25538), 12986 states have internal predecessors, (25538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12987 states to 12987 states and 25538 transitions. [2022-03-03 18:28:07,784 INFO L78 Accepts]: Start accepts. Automaton has 12987 states and 25538 transitions. Word has length 484 [2022-03-03 18:28:07,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:07,784 INFO L470 AbstractCegarLoop]: Abstraction has 12987 states and 25538 transitions. [2022-03-03 18:28:07,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:07,784 INFO L276 IsEmpty]: Start isEmpty. Operand 12987 states and 25538 transitions. [2022-03-03 18:28:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:28:07,787 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:07,788 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:07,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-03-03 18:28:07,788 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:07,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:07,788 INFO L85 PathProgramCache]: Analyzing trace with hash -39862168, now seen corresponding path program 23 times [2022-03-03 18:28:07,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:07,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299928188] [2022-03-03 18:28:07,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:07,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:08,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:08,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299928188] [2022-03-03 18:28:08,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299928188] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:08,052 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:28:08,052 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:28:08,052 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255011846] [2022-03-03 18:28:08,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:08,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:28:08,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:08,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:28:08,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:28:08,053 INFO L87 Difference]: Start difference. First operand 12987 states and 25538 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:09,220 INFO L93 Difference]: Finished difference Result 24029 states and 47620 transitions. [2022-03-03 18:28:09,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-03 18:28:09,220 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:28:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:09,254 INFO L225 Difference]: With dead ends: 24029 [2022-03-03 18:28:09,254 INFO L226 Difference]: Without dead ends: 24029 [2022-03-03 18:28:09,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:28:09,254 INFO L933 BasicCegarLoop]: 811 mSDtfsCounter, 1045 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 4040 SdHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:09,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1045 Valid, 4040 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-03 18:28:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24029 states. [2022-03-03 18:28:09,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24029 to 13215. [2022-03-03 18:28:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13215 states, 13151 states have (on average 1.9765797277773554) internal successors, (25994), 13214 states have internal predecessors, (25994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13215 states to 13215 states and 25994 transitions. [2022-03-03 18:28:09,477 INFO L78 Accepts]: Start accepts. Automaton has 13215 states and 25994 transitions. Word has length 484 [2022-03-03 18:28:09,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:09,477 INFO L470 AbstractCegarLoop]: Abstraction has 13215 states and 25994 transitions. [2022-03-03 18:28:09,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 13215 states and 25994 transitions. [2022-03-03 18:28:09,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:28:09,480 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:09,481 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:09,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-03-03 18:28:09,481 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:09,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1812860048, now seen corresponding path program 24 times [2022-03-03 18:28:09,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:09,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303897756] [2022-03-03 18:28:09,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:09,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:09,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303897756] [2022-03-03 18:28:09,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303897756] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:09,732 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:28:09,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:28:09,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816172741] [2022-03-03 18:28:09,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:09,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:28:09,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:09,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:28:09,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:28:09,733 INFO L87 Difference]: Start difference. First operand 13215 states and 25994 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:10,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:10,443 INFO L93 Difference]: Finished difference Result 13519 states and 26600 transitions. [2022-03-03 18:28:10,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-03 18:28:10,443 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:28:10,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:10,461 INFO L225 Difference]: With dead ends: 13519 [2022-03-03 18:28:10,461 INFO L226 Difference]: Without dead ends: 13519 [2022-03-03 18:28:10,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-03 18:28:10,462 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 282 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:10,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 2734 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:28:10,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13519 states. [2022-03-03 18:28:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13519 to 13214. [2022-03-03 18:28:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-03 18:28:10,663 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-03 18:28:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:10,664 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-03 18:28:10,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-03 18:28:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:28:10,667 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:10,667 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:10,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-03-03 18:28:10,667 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:10,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1603014754, now seen corresponding path program 25 times [2022-03-03 18:28:10,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:10,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090206402] [2022-03-03 18:28:10,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:10,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:10,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:10,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090206402] [2022-03-03 18:28:10,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090206402] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:10,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:28:10,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:28:10,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121693920] [2022-03-03 18:28:10,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:10,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:28:10,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:10,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:28:10,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:28:10,925 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:11,564 INFO L93 Difference]: Finished difference Result 13573 states and 26708 transitions. [2022-03-03 18:28:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-03 18:28:11,564 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:28:11,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:11,581 INFO L225 Difference]: With dead ends: 13573 [2022-03-03 18:28:11,581 INFO L226 Difference]: Without dead ends: 13573 [2022-03-03 18:28:11,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-03 18:28:11,581 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 300 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:11,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 2444 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-03 18:28:11,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13573 states. [2022-03-03 18:28:11,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13573 to 13214. [2022-03-03 18:28:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:11,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-03 18:28:11,734 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-03 18:28:11,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:11,734 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-03 18:28:11,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-03 18:28:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:28:11,737 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:11,737 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:11,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-03-03 18:28:11,738 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:11,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:11,738 INFO L85 PathProgramCache]: Analyzing trace with hash 734355438, now seen corresponding path program 26 times [2022-03-03 18:28:11,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:11,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915703856] [2022-03-03 18:28:11,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:11,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:11,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:11,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915703856] [2022-03-03 18:28:11,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915703856] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:11,973 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:28:11,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:28:11,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085478505] [2022-03-03 18:28:11,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:11,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:28:11,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:11,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:28:11,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:28:11,974 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:13,033 INFO L93 Difference]: Finished difference Result 13621 states and 26804 transitions. [2022-03-03 18:28:13,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-03 18:28:13,034 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:28:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:13,052 INFO L225 Difference]: With dead ends: 13621 [2022-03-03 18:28:13,052 INFO L226 Difference]: Without dead ends: 13621 [2022-03-03 18:28:13,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-03-03 18:28:13,052 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 299 mSDsluCounter, 2815 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 3333 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:13,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 3333 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2061 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-03 18:28:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13621 states. [2022-03-03 18:28:13,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13621 to 13214. [2022-03-03 18:28:13,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-03 18:28:13,223 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-03 18:28:13,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:13,223 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-03 18:28:13,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:13,224 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-03 18:28:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:28:13,227 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:13,227 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:13,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-03-03 18:28:13,227 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:13,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:13,227 INFO L85 PathProgramCache]: Analyzing trace with hash 923089856, now seen corresponding path program 27 times [2022-03-03 18:28:13,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:13,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934182545] [2022-03-03 18:28:13,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:13,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:13,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:13,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934182545] [2022-03-03 18:28:13,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934182545] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:13,530 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:28:13,530 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:28:13,530 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924202084] [2022-03-03 18:28:13,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:13,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:28:13,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:13,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:28:13,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:28:13,531 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:14,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:14,255 INFO L93 Difference]: Finished difference Result 13675 states and 26912 transitions. [2022-03-03 18:28:14,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-03 18:28:14,255 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:28:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:14,272 INFO L225 Difference]: With dead ends: 13675 [2022-03-03 18:28:14,272 INFO L226 Difference]: Without dead ends: 13675 [2022-03-03 18:28:14,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-03-03 18:28:14,272 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 325 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:14,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 2522 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-03 18:28:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13675 states. [2022-03-03 18:28:14,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13675 to 13214. [2022-03-03 18:28:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-03 18:28:14,426 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-03 18:28:14,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:14,426 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-03 18:28:14,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-03 18:28:14,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:28:14,429 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:14,429 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:14,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-03-03 18:28:14,430 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:14,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:14,430 INFO L85 PathProgramCache]: Analyzing trace with hash -517087676, now seen corresponding path program 11 times [2022-03-03 18:28:14,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:14,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523661957] [2022-03-03 18:28:14,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:14,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:14,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:14,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523661957] [2022-03-03 18:28:14,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523661957] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:14,638 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:28:14,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:28:14,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229283051] [2022-03-03 18:28:14,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:14,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:28:14,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:14,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:28:14,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:28:14,639 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:16,265 INFO L93 Difference]: Finished difference Result 23827 states and 47216 transitions. [2022-03-03 18:28:16,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-03 18:28:16,265 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:28:16,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:16,301 INFO L225 Difference]: With dead ends: 23827 [2022-03-03 18:28:16,302 INFO L226 Difference]: Without dead ends: 23827 [2022-03-03 18:28:16,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2022-03-03 18:28:16,302 INFO L933 BasicCegarLoop]: 928 mSDtfsCounter, 818 mSDsluCounter, 4516 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 5442 SdHoareTripleChecker+Invalid, 3499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:16,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [818 Valid, 5442 Invalid, 3499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-03 18:28:16,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23827 states. [2022-03-03 18:28:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23827 to 12971. [2022-03-03 18:28:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12907 states have (on average 1.9761369799333695) internal successors, (25506), 12970 states have internal predecessors, (25506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-03 18:28:16,522 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-03 18:28:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:16,522 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-03 18:28:16,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-03 18:28:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:28:16,525 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:16,526 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:16,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-03-03 18:28:16,526 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:16,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:16,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1371051488, now seen corresponding path program 28 times [2022-03-03 18:28:16,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:16,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035637630] [2022-03-03 18:28:16,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:16,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:16,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:16,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035637630] [2022-03-03 18:28:16,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035637630] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:16,823 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:28:16,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:28:16,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062672845] [2022-03-03 18:28:16,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:16,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:28:16,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:16,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:28:16,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:28:16,824 INFO L87 Difference]: Start difference. First operand 12971 states and 25506 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:18,161 INFO L93 Difference]: Finished difference Result 23624 states and 46810 transitions. [2022-03-03 18:28:18,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-03 18:28:18,162 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:28:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:18,196 INFO L225 Difference]: With dead ends: 23624 [2022-03-03 18:28:18,196 INFO L226 Difference]: Without dead ends: 23624 [2022-03-03 18:28:18,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-03-03 18:28:18,197 INFO L933 BasicCegarLoop]: 840 mSDtfsCounter, 1007 mSDsluCounter, 3571 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 4411 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:18,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1007 Valid, 4411 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-03 18:28:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2022-03-03 18:28:18,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 12875. [2022-03-03 18:28:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12875 states, 12812 states have (on average 1.9758039338120512) internal successors, (25314), 12874 states have internal predecessors, (25314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12875 states to 12875 states and 25314 transitions. [2022-03-03 18:28:18,423 INFO L78 Accepts]: Start accepts. Automaton has 12875 states and 25314 transitions. Word has length 484 [2022-03-03 18:28:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:18,423 INFO L470 AbstractCegarLoop]: Abstraction has 12875 states and 25314 transitions. [2022-03-03 18:28:18,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 12875 states and 25314 transitions. [2022-03-03 18:28:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-03 18:28:18,426 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:18,427 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:18,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-03-03 18:28:18,427 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:18,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2109607296, now seen corresponding path program 12 times [2022-03-03 18:28:18,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:18,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202931915] [2022-03-03 18:28:18,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:18,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:18,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:18,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202931915] [2022-03-03 18:28:18,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202931915] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:18,637 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:28:18,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 18:28:18,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403521052] [2022-03-03 18:28:18,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:18,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-03 18:28:18,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:18,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-03 18:28:18,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-03 18:28:18,638 INFO L87 Difference]: Start difference. First operand 12875 states and 25314 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:20,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:20,229 INFO L93 Difference]: Finished difference Result 23548 states and 46658 transitions. [2022-03-03 18:28:20,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-03 18:28:20,229 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-03 18:28:20,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:20,263 INFO L225 Difference]: With dead ends: 23548 [2022-03-03 18:28:20,263 INFO L226 Difference]: Without dead ends: 23548 [2022-03-03 18:28:20,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2022-03-03 18:28:20,264 INFO L933 BasicCegarLoop]: 960 mSDtfsCounter, 776 mSDsluCounter, 4121 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 5079 SdHoareTripleChecker+Invalid, 3176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:20,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [776 Valid, 5079 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-03 18:28:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23548 states. [2022-03-03 18:28:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23548 to 12618. [2022-03-03 18:28:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12618 states, 12555 states have (on average 1.9753086419753085) internal successors, (24800), 12617 states have internal predecessors, (24800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12618 states to 12618 states and 24800 transitions. [2022-03-03 18:28:20,478 INFO L78 Accepts]: Start accepts. Automaton has 12618 states and 24800 transitions. Word has length 484 [2022-03-03 18:28:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:20,478 INFO L470 AbstractCegarLoop]: Abstraction has 12618 states and 24800 transitions. [2022-03-03 18:28:20,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 12618 states and 24800 transitions. [2022-03-03 18:28:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-03-03 18:28:20,481 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:20,482 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:20,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-03-03 18:28:20,482 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:20,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash -958574857, now seen corresponding path program 1 times [2022-03-03 18:28:20,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:20,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232361186] [2022-03-03 18:28:20,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:20,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:20,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:20,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232361186] [2022-03-03 18:28:20,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232361186] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:20,717 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:28:20,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:28:20,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640405153] [2022-03-03 18:28:20,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:20,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:28:20,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:20,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:28:20,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:28:20,718 INFO L87 Difference]: Start difference. First operand 12618 states and 24800 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:21,088 INFO L93 Difference]: Finished difference Result 13358 states and 26280 transitions. [2022-03-03 18:28:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:28:21,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 488 [2022-03-03 18:28:21,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:21,104 INFO L225 Difference]: With dead ends: 13358 [2022-03-03 18:28:21,105 INFO L226 Difference]: Without dead ends: 13358 [2022-03-03 18:28:21,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:28:21,105 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 250 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:21,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 958 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-03 18:28:21,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13358 states. [2022-03-03 18:28:21,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13358 to 12928. [2022-03-03 18:28:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12928 states, 12866 states have (on average 1.9757500388621172) internal successors, (25420), 12927 states have internal predecessors, (25420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:21,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12928 states to 12928 states and 25420 transitions. [2022-03-03 18:28:21,259 INFO L78 Accepts]: Start accepts. Automaton has 12928 states and 25420 transitions. Word has length 488 [2022-03-03 18:28:21,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:21,259 INFO L470 AbstractCegarLoop]: Abstraction has 12928 states and 25420 transitions. [2022-03-03 18:28:21,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:21,259 INFO L276 IsEmpty]: Start isEmpty. Operand 12928 states and 25420 transitions. [2022-03-03 18:28:21,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-03-03 18:28:21,262 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:21,262 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:21,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-03-03 18:28:21,263 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:21,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:21,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1510925397, now seen corresponding path program 1 times [2022-03-03 18:28:21,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:21,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340171279] [2022-03-03 18:28:21,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:21,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:21,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:21,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340171279] [2022-03-03 18:28:21,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340171279] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:21,442 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:28:21,442 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:28:21,442 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286179257] [2022-03-03 18:28:21,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:21,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:28:21,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:21,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:28:21,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:28:21,443 INFO L87 Difference]: Start difference. First operand 12928 states and 25420 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:22,014 INFO L93 Difference]: Finished difference Result 13909 states and 27382 transitions. [2022-03-03 18:28:22,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:28:22,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 488 [2022-03-03 18:28:22,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:22,033 INFO L225 Difference]: With dead ends: 13909 [2022-03-03 18:28:22,034 INFO L226 Difference]: Without dead ends: 13909 [2022-03-03 18:28:22,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:28:22,034 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 317 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:22,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 1271 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-03 18:28:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13909 states. [2022-03-03 18:28:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13909 to 13339. [2022-03-03 18:28:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13339 states, 13280 states have (on average 1.97605421686747) internal successors, (26242), 13338 states have internal predecessors, (26242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13339 states to 13339 states and 26242 transitions. [2022-03-03 18:28:22,194 INFO L78 Accepts]: Start accepts. Automaton has 13339 states and 26242 transitions. Word has length 488 [2022-03-03 18:28:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:22,194 INFO L470 AbstractCegarLoop]: Abstraction has 13339 states and 26242 transitions. [2022-03-03 18:28:22,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 13339 states and 26242 transitions. [2022-03-03 18:28:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-03-03 18:28:22,197 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:22,197 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:22,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-03-03 18:28:22,198 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:22,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1249761024, now seen corresponding path program 1 times [2022-03-03 18:28:22,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:22,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176972327] [2022-03-03 18:28:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 2 proven. 1244 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2022-03-03 18:28:23,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:23,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176972327] [2022-03-03 18:28:23,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176972327] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:28:23,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843335175] [2022-03-03 18:28:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:23,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:23,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:28:23,493 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:28:23,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-03 18:28:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:25,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-03 18:28:25,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:28:26,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:28:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:26,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:28:26,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843335175] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:26,349 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:28:26,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [20] total 25 [2022-03-03 18:28:26,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458910521] [2022-03-03 18:28:26,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:26,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:28:26,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:26,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:28:26,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-03-03 18:28:26,351 INFO L87 Difference]: Start difference. First operand 13339 states and 26242 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:26,589 INFO L93 Difference]: Finished difference Result 35101 states and 69697 transitions. [2022-03-03 18:28:26,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:28:26,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 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 494 [2022-03-03 18:28:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:26,643 INFO L225 Difference]: With dead ends: 35101 [2022-03-03 18:28:26,643 INFO L226 Difference]: Without dead ends: 35101 [2022-03-03 18:28:26,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 504 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2022-03-03 18:28:26,643 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 715 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:26,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [715 Valid, 1591 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 18:28:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35101 states. [2022-03-03 18:28:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35101 to 13790. [2022-03-03 18:28:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13790 states, 13729 states have (on average 1.9721756865030229) internal successors, (27076), 13789 states have internal predecessors, (27076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13790 states to 13790 states and 27076 transitions. [2022-03-03 18:28:26,952 INFO L78 Accepts]: Start accepts. Automaton has 13790 states and 27076 transitions. Word has length 494 [2022-03-03 18:28:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:26,952 INFO L470 AbstractCegarLoop]: Abstraction has 13790 states and 27076 transitions. [2022-03-03 18:28:26,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 13790 states and 27076 transitions. [2022-03-03 18:28:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-03-03 18:28:26,955 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:26,956 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:26,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-03 18:28:27,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:27,157 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:27,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:27,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1054999182, now seen corresponding path program 2 times [2022-03-03 18:28:27,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:27,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623995628] [2022-03-03 18:28:27,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:27,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 2 proven. 1161 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2022-03-03 18:28:28,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:28,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623995628] [2022-03-03 18:28:28,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623995628] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:28:28,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267244056] [2022-03-03 18:28:28,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:28:28,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:28,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:28:28,272 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:28:28,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-03 18:28:30,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 18:28:30,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:28:30,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-03 18:28:30,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:28:30,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:28:31,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:31,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:28:31,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267244056] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:31,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:28:31,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 22 [2022-03-03 18:28:31,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673393772] [2022-03-03 18:28:31,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:31,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:28:31,021 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:31,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:28:31,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-03-03 18:28:31,021 INFO L87 Difference]: Start difference. First operand 13790 states and 27076 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:31,232 INFO L93 Difference]: Finished difference Result 35769 states and 70870 transitions. [2022-03-03 18:28:31,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-03 18:28:31,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 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 494 [2022-03-03 18:28:31,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:31,286 INFO L225 Difference]: With dead ends: 35769 [2022-03-03 18:28:31,286 INFO L226 Difference]: Without dead ends: 35769 [2022-03-03 18:28:31,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 508 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:28:31,286 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 910 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:31,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [910 Valid, 1238 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 18:28:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35769 states. [2022-03-03 18:28:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35769 to 13982. [2022-03-03 18:28:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13982 states, 13917 states have (on average 1.9663720629446002) internal successors, (27366), 13981 states have internal predecessors, (27366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13982 states to 13982 states and 27366 transitions. [2022-03-03 18:28:31,569 INFO L78 Accepts]: Start accepts. Automaton has 13982 states and 27366 transitions. Word has length 494 [2022-03-03 18:28:31,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:31,569 INFO L470 AbstractCegarLoop]: Abstraction has 13982 states and 27366 transitions. [2022-03-03 18:28:31,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 13982 states and 27366 transitions. [2022-03-03 18:28:31,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-03-03 18:28:31,573 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:31,573 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:31,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-03 18:28:31,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:31,774 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:31,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:31,774 INFO L85 PathProgramCache]: Analyzing trace with hash -251041000, now seen corresponding path program 3 times [2022-03-03 18:28:31,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:31,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371040543] [2022-03-03 18:28:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:31,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 2 proven. 1161 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2022-03-03 18:28:32,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:32,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371040543] [2022-03-03 18:28:32,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371040543] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:28:32,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040899600] [2022-03-03 18:28:32,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:28:32,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:32,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:28:32,806 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:28:32,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-03 18:28:34,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-03 18:28:34,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:28:34,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-03 18:28:34,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:28:35,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:28:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:28:35,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:28:35,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040899600] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:28:35,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:28:35,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 23 [2022-03-03 18:28:35,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644965260] [2022-03-03 18:28:35,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:28:35,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:28:35,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:28:35,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:28:35,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:28:35,511 INFO L87 Difference]: Start difference. First operand 13982 states and 27366 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:28:35,801 INFO L93 Difference]: Finished difference Result 45755 states and 90748 transitions. [2022-03-03 18:28:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-03 18:28:35,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 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 494 [2022-03-03 18:28:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:28:35,869 INFO L225 Difference]: With dead ends: 45755 [2022-03-03 18:28:35,869 INFO L226 Difference]: Without dead ends: 45755 [2022-03-03 18:28:35,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2022-03-03 18:28:35,870 INFO L933 BasicCegarLoop]: 466 mSDtfsCounter, 1238 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:28:35,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1238 Valid, 1691 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 18:28:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45755 states. [2022-03-03 18:28:36,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45755 to 13984. [2022-03-03 18:28:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13984 states, 13919 states have (on average 1.9663768948918745) internal successors, (27370), 13983 states have internal predecessors, (27370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13984 states to 13984 states and 27370 transitions. [2022-03-03 18:28:36,211 INFO L78 Accepts]: Start accepts. Automaton has 13984 states and 27370 transitions. Word has length 494 [2022-03-03 18:28:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:28:36,211 INFO L470 AbstractCegarLoop]: Abstraction has 13984 states and 27370 transitions. [2022-03-03 18:28:36,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:28:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 13984 states and 27370 transitions. [2022-03-03 18:28:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-03-03 18:28:36,215 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:28:36,215 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:28:36,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-03 18:28:36,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:36,416 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:28:36,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:28:36,416 INFO L85 PathProgramCache]: Analyzing trace with hash -824021608, now seen corresponding path program 4 times [2022-03-03 18:28:36,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:28:36,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000206726] [2022-03-03 18:28:36,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:28:36,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:28:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:28:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 2 proven. 1161 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2022-03-03 18:28:37,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:28:37,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000206726] [2022-03-03 18:28:37,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000206726] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:28:37,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257963671] [2022-03-03 18:28:37,360 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 18:28:37,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:28:37,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:28:37,361 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:28:37,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-03 18:33:15,881 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 18:33:15,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:33:15,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-03 18:33:16,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:33:16,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 18:33:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:33:16,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 18:33:16,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257963671] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:33:16,772 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:33:16,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 23 [2022-03-03 18:33:16,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088625175] [2022-03-03 18:33:16,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:33:16,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:33:16,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:33:16,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:33:16,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-03-03 18:33:16,773 INFO L87 Difference]: Start difference. First operand 13984 states and 27370 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:33:16,984 INFO L93 Difference]: Finished difference Result 35462 states and 70231 transitions. [2022-03-03 18:33:16,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:33:16,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 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 494 [2022-03-03 18:33:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:33:17,042 INFO L225 Difference]: With dead ends: 35462 [2022-03-03 18:33:17,042 INFO L226 Difference]: Without dead ends: 35462 [2022-03-03 18:33:17,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2022-03-03 18:33:17,042 INFO L933 BasicCegarLoop]: 472 mSDtfsCounter, 794 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:33:17,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [794 Valid, 1273 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 18:33:17,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35462 states. [2022-03-03 18:33:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35462 to 14266. [2022-03-03 18:33:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14266 states, 14201 states have (on average 1.9670445743257516) internal successors, (27934), 14265 states have internal predecessors, (27934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14266 states to 14266 states and 27934 transitions. [2022-03-03 18:33:17,351 INFO L78 Accepts]: Start accepts. Automaton has 14266 states and 27934 transitions. Word has length 494 [2022-03-03 18:33:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:33:17,352 INFO L470 AbstractCegarLoop]: Abstraction has 14266 states and 27934 transitions. [2022-03-03 18:33:17,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:17,352 INFO L276 IsEmpty]: Start isEmpty. Operand 14266 states and 27934 transitions. [2022-03-03 18:33:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-03-03 18:33:17,354 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:33:17,354 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:33:17,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-03 18:33:17,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:33:17,555 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:33:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:33:17,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1941473761, now seen corresponding path program 1 times [2022-03-03 18:33:17,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:33:17,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197610958] [2022-03-03 18:33:17,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:33:17,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:33:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:33:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:33:17,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:33:17,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197610958] [2022-03-03 18:33:17,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197610958] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:33:17,785 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:33:17,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:33:17,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964343962] [2022-03-03 18:33:17,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:33:17,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:33:17,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:33:17,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:33:17,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:33:17,786 INFO L87 Difference]: Start difference. First operand 14266 states and 27934 transitions. Second operand has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:18,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:33:18,107 INFO L93 Difference]: Finished difference Result 14670 states and 28743 transitions. [2022-03-03 18:33:18,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:33:18,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 497 [2022-03-03 18:33:18,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:33:18,127 INFO L225 Difference]: With dead ends: 14670 [2022-03-03 18:33:18,127 INFO L226 Difference]: Without dead ends: 14670 [2022-03-03 18:33:18,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:33:18,128 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 243 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:33:18,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 801 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-03 18:33:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14670 states. [2022-03-03 18:33:18,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14670 to 14577. [2022-03-03 18:33:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14577 states, 14513 states have (on average 1.967684145249087) internal successors, (28557), 14576 states have internal predecessors, (28557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14577 states to 14577 states and 28557 transitions. [2022-03-03 18:33:18,368 INFO L78 Accepts]: Start accepts. Automaton has 14577 states and 28557 transitions. Word has length 497 [2022-03-03 18:33:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:33:18,368 INFO L470 AbstractCegarLoop]: Abstraction has 14577 states and 28557 transitions. [2022-03-03 18:33:18,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 14577 states and 28557 transitions. [2022-03-03 18:33:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-03-03 18:33:18,370 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:33:18,370 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:33:18,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-03-03 18:33:18,371 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:33:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:33:18,371 INFO L85 PathProgramCache]: Analyzing trace with hash 111462508, now seen corresponding path program 1 times [2022-03-03 18:33:18,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:33:18,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228213951] [2022-03-03 18:33:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:33:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:33:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:33:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:33:18,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:33:18,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228213951] [2022-03-03 18:33:18,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228213951] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:33:18,566 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:33:18,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:33:18,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794155164] [2022-03-03 18:33:18,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:33:18,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:33:18,567 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:33:18,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:33:18,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:33:18,567 INFO L87 Difference]: Start difference. First operand 14577 states and 28557 transitions. Second operand has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:33:18,954 INFO L93 Difference]: Finished difference Result 15135 states and 29674 transitions. [2022-03-03 18:33:18,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:33:18,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 497 [2022-03-03 18:33:18,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:33:18,976 INFO L225 Difference]: With dead ends: 15135 [2022-03-03 18:33:18,976 INFO L226 Difference]: Without dead ends: 15135 [2022-03-03 18:33:18,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:33:18,976 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 314 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:33:18,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 1017 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-03 18:33:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15135 states. [2022-03-03 18:33:19,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15135 to 15006. [2022-03-03 18:33:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15006 states, 14943 states have (on average 1.9685471458207857) internal successors, (29416), 15005 states have internal predecessors, (29416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15006 states to 15006 states and 29416 transitions. [2022-03-03 18:33:19,173 INFO L78 Accepts]: Start accepts. Automaton has 15006 states and 29416 transitions. Word has length 497 [2022-03-03 18:33:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:33:19,173 INFO L470 AbstractCegarLoop]: Abstraction has 15006 states and 29416 transitions. [2022-03-03 18:33:19,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 15006 states and 29416 transitions. [2022-03-03 18:33:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2022-03-03 18:33:19,176 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:33:19,176 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:33:19,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-03-03 18:33:19,177 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:33:19,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:33:19,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1748819159, now seen corresponding path program 1 times [2022-03-03 18:33:19,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:33:19,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424608495] [2022-03-03 18:33:19,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:33:19,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:33:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:33:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:33:19,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:33:19,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424608495] [2022-03-03 18:33:19,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424608495] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:33:19,385 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:33:19,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:33:19,386 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491018708] [2022-03-03 18:33:19,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:33:19,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:33:19,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:33:19,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:33:19,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:33:19,386 INFO L87 Difference]: Start difference. First operand 15006 states and 29416 transitions. Second operand has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:33:19,685 INFO L93 Difference]: Finished difference Result 15412 states and 30229 transitions. [2022-03-03 18:33:19,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:33:19,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 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 505 [2022-03-03 18:33:19,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:33:19,710 INFO L225 Difference]: With dead ends: 15412 [2022-03-03 18:33:19,711 INFO L226 Difference]: Without dead ends: 15412 [2022-03-03 18:33:19,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:33:19,711 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 243 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:33:19,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 801 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 18:33:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15412 states. [2022-03-03 18:33:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15412 to 15316. [2022-03-03 18:33:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15316 states, 15254 states have (on average 1.969122853022158) internal successors, (30037), 15315 states have internal predecessors, (30037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15316 states to 15316 states and 30037 transitions. [2022-03-03 18:33:19,929 INFO L78 Accepts]: Start accepts. Automaton has 15316 states and 30037 transitions. Word has length 505 [2022-03-03 18:33:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:33:19,929 INFO L470 AbstractCegarLoop]: Abstraction has 15316 states and 30037 transitions. [2022-03-03 18:33:19,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 15316 states and 30037 transitions. [2022-03-03 18:33:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2022-03-03 18:33:19,931 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:33:19,932 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:33:19,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-03-03 18:33:19,932 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:33:19,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:33:19,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1113319281, now seen corresponding path program 1 times [2022-03-03 18:33:19,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:33:19,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289776412] [2022-03-03 18:33:19,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:33:19,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:33:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:33:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:33:20,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:33:20,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289776412] [2022-03-03 18:33:20,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289776412] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:33:20,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:33:20,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:33:20,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384214642] [2022-03-03 18:33:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:33:20,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:33:20,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:33:20,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:33:20,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:33:20,243 INFO L87 Difference]: Start difference. First operand 15316 states and 30037 transitions. Second operand has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:33:20,721 INFO L93 Difference]: Finished difference Result 15876 states and 31158 transitions. [2022-03-03 18:33:20,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:33:20,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 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 505 [2022-03-03 18:33:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:33:20,755 INFO L225 Difference]: With dead ends: 15876 [2022-03-03 18:33:20,755 INFO L226 Difference]: Without dead ends: 15344 [2022-03-03 18:33:20,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:33:20,755 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 314 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 18:33:20,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 1052 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 18:33:20,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15344 states. [2022-03-03 18:33:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15344 to 15147. [2022-03-03 18:33:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15147 states, 15086 states have (on average 1.9657961023465464) internal successors, (29656), 15146 states have internal predecessors, (29656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15147 states to 15147 states and 29656 transitions. [2022-03-03 18:33:20,970 INFO L78 Accepts]: Start accepts. Automaton has 15147 states and 29656 transitions. Word has length 505 [2022-03-03 18:33:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:33:20,970 INFO L470 AbstractCegarLoop]: Abstraction has 15147 states and 29656 transitions. [2022-03-03 18:33:20,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 15147 states and 29656 transitions. [2022-03-03 18:33:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2022-03-03 18:33:20,973 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:33:20,974 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:33:20,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-03-03 18:33:20,974 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:33:20,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:33:20,974 INFO L85 PathProgramCache]: Analyzing trace with hash -652155431, now seen corresponding path program 1 times [2022-03-03 18:33:20,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:33:20,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672848694] [2022-03-03 18:33:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:33:20,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:33:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:33:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:33:21,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:33:21,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672848694] [2022-03-03 18:33:21,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672848694] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:33:21,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:33:21,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:33:21,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594084032] [2022-03-03 18:33:21,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:33:21,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:33:21,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:33:21,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:33:21,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:33:21,193 INFO L87 Difference]: Start difference. First operand 15147 states and 29656 transitions. Second operand has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:33:21,586 INFO L93 Difference]: Finished difference Result 15622 states and 30607 transitions. [2022-03-03 18:33:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:33:21,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 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 521 [2022-03-03 18:33:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:33:21,621 INFO L225 Difference]: With dead ends: 15622 [2022-03-03 18:33:21,621 INFO L226 Difference]: Without dead ends: 15622 [2022-03-03 18:33:21,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:33:21,622 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 242 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:33:21,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 1008 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-03 18:33:21,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15622 states. [2022-03-03 18:33:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15622 to 15440. [2022-03-03 18:33:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15440 states, 15382 states have (on average 1.9661292419711351) internal successors, (30243), 15439 states have internal predecessors, (30243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:21,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15440 states to 15440 states and 30243 transitions. [2022-03-03 18:33:21,852 INFO L78 Accepts]: Start accepts. Automaton has 15440 states and 30243 transitions. Word has length 521 [2022-03-03 18:33:21,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:33:21,852 INFO L470 AbstractCegarLoop]: Abstraction has 15440 states and 30243 transitions. [2022-03-03 18:33:21,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 15440 states and 30243 transitions. [2022-03-03 18:33:21,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2022-03-03 18:33:21,855 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:33:21,855 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:33:21,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-03-03 18:33:21,855 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:33:21,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:33:21,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1159767968, now seen corresponding path program 1 times [2022-03-03 18:33:21,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:33:21,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385660846] [2022-03-03 18:33:21,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:33:21,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:33:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:33:22,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-03 18:33:22,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:33:22,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385660846] [2022-03-03 18:33:22,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385660846] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:33:22,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:33:22,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:33:22,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243202308] [2022-03-03 18:33:22,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:33:22,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:33:22,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:33:22,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:33:22,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:33:22,052 INFO L87 Difference]: Start difference. First operand 15440 states and 30243 transitions. Second operand has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:22,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:33:22,419 INFO L93 Difference]: Finished difference Result 17574 states and 34484 transitions. [2022-03-03 18:33:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:33:22,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 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 531 [2022-03-03 18:33:22,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:33:22,450 INFO L225 Difference]: With dead ends: 17574 [2022-03-03 18:33:22,451 INFO L226 Difference]: Without dead ends: 17223 [2022-03-03 18:33:22,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:33:22,451 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 304 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 18:33:22,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 937 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-03 18:33:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17223 states. [2022-03-03 18:33:22,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17223 to 15344. [2022-03-03 18:33:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15344 states, 15289 states have (on average 1.9638302047223495) internal successors, (30025), 15343 states have internal predecessors, (30025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15344 states to 15344 states and 30025 transitions. [2022-03-03 18:33:22,803 INFO L78 Accepts]: Start accepts. Automaton has 15344 states and 30025 transitions. Word has length 531 [2022-03-03 18:33:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:33:22,803 INFO L470 AbstractCegarLoop]: Abstraction has 15344 states and 30025 transitions. [2022-03-03 18:33:22,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:33:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 15344 states and 30025 transitions. [2022-03-03 18:33:22,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2022-03-03 18:33:22,809 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:33:22,809 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:33:22,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-03-03 18:33:22,809 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:33:22,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:33:22,810 INFO L85 PathProgramCache]: Analyzing trace with hash -723369720, now seen corresponding path program 1 times [2022-03-03 18:33:22,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:33:22,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949193060] [2022-03-03 18:33:22,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:33:22,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:33:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:33:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 39 proven. 1086 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2022-03-03 18:33:23,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:33:23,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949193060] [2022-03-03 18:33:23,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949193060] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:33:23,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679502004] [2022-03-03 18:33:23,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:33:23,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:33:23,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:33:23,989 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:33:23,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-03 18:33:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:33:26,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 2157 conjuncts, 116 conjunts are in the unsatisfiable core [2022-03-03 18:33:26,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:33:26,562 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 18:33:26,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-03-03 18:33:26,737 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-03 18:33:26,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-03 18:33:27,274 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-03 18:33:27,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-03 18:33:27,761 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-03 18:33:27,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-03 18:33:28,310 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-03 18:33:28,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-03 18:33:28,822 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-03 18:33:28,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-03 18:33:30,105 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-03 18:33:30,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 50 [2022-03-03 18:33:31,560 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-03 18:33:31,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 50 [2022-03-03 18:33:32,904 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-03 18:33:32,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 50 [2022-03-03 18:33:34,015 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-03 18:33:34,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 50 [2022-03-03 18:33:35,194 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-03 18:33:35,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 50 [2022-03-03 18:33:36,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 18:33:37,332 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-03 18:33:37,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 50 [2022-03-03 18:33:39,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 18:33:39,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-03-03 18:33:40,044 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-03 18:33:40,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 50 [2022-03-03 18:33:40,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 18:33:40,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:40,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-03-03 18:33:40,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:40,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:40,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:40,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-03-03 18:33:41,024 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-03 18:33:41,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2022-03-03 18:33:41,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:41,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:41,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:41,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-03-03 18:33:41,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:41,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:41,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:41,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:41,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:41,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:33:41,262 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-03-03 18:33:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 996 proven. 27 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2022-03-03 18:33:41,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:33:51,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-03-03 18:33:51,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-03-03 18:34:18,254 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-03 18:34:18,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 188 treesize of output 183 [2022-03-03 18:34:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 1004 proven. 7 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2022-03-03 18:34:18,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679502004] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:34:18,445 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:34:18,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 16] total 54 [2022-03-03 18:34:18,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15786437] [2022-03-03 18:34:18,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:34:18,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-03 18:34:18,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:34:18,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-03 18:34:18,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=2452, Unknown=6, NotChecked=0, Total=2970 [2022-03-03 18:34:18,447 INFO L87 Difference]: Start difference. First operand 15344 states and 30025 transitions. Second operand has 55 states, 54 states have (on average 13.25925925925926) internal successors, (716), 55 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:34:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:34:21,240 INFO L93 Difference]: Finished difference Result 28057 states and 55986 transitions. [2022-03-03 18:34:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-03 18:34:21,240 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 13.25925925925926) internal successors, (716), 55 states have internal predecessors, (716), 0 states have call successors, (0), 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 566 [2022-03-03 18:34:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:34:21,295 INFO L225 Difference]: With dead ends: 28057 [2022-03-03 18:34:21,295 INFO L226 Difference]: Without dead ends: 28057 [2022-03-03 18:34:21,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1230 GetRequests, 1111 SyntacticMatches, 32 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4106 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=1290, Invalid=6536, Unknown=6, NotChecked=0, Total=7832 [2022-03-03 18:34:21,296 INFO L933 BasicCegarLoop]: 553 mSDtfsCounter, 1756 mSDsluCounter, 7886 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 8439 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 681 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:34:21,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1756 Valid, 8439 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1150 Invalid, 0 Unknown, 681 Unchecked, 0.8s Time] [2022-03-03 18:34:21,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28057 states. [2022-03-03 18:34:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28057 to 19015. [2022-03-03 18:34:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19015 states, 18960 states have (on average 1.969831223628692) internal successors, (37348), 19014 states have internal predecessors, (37348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:34:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19015 states to 19015 states and 37348 transitions. [2022-03-03 18:34:21,640 INFO L78 Accepts]: Start accepts. Automaton has 19015 states and 37348 transitions. Word has length 566 [2022-03-03 18:34:21,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:34:21,640 INFO L470 AbstractCegarLoop]: Abstraction has 19015 states and 37348 transitions. [2022-03-03 18:34:21,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 13.25925925925926) internal successors, (716), 55 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:34:21,641 INFO L276 IsEmpty]: Start isEmpty. Operand 19015 states and 37348 transitions. [2022-03-03 18:34:21,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2022-03-03 18:34:21,648 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:34:21,648 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:34:21,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-03 18:34:21,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2022-03-03 18:34:21,849 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:34:21,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:34:21,850 INFO L85 PathProgramCache]: Analyzing trace with hash -723437610, now seen corresponding path program 2 times [2022-03-03 18:34:21,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:34:21,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432892667] [2022-03-03 18:34:21,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:34:21,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:34:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:34:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 108 proven. 1009 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2022-03-03 18:34:23,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:34:23,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432892667] [2022-03-03 18:34:23,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432892667] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:34:23,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968330330] [2022-03-03 18:34:23,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 18:34:23,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:34:23,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:34:23,200 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:34:23,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-03 18:34:25,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 18:34:25,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 18:34:25,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 2157 conjuncts, 96 conjunts are in the unsatisfiable core [2022-03-03 18:34:25,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 18:34:25,865 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 18:34:25,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 18:34:25,923 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 18:34:25,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 18:34:26,163 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 18:34:26,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 18:34:26,396 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 18:34:26,397 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 18:34:26,629 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 18:34:26,630 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 18:34:26,865 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 18:34:26,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 18:34:27,108 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 18:34:27,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 18:34:27,351 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-03 18:34:27,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-03 18:34:27,633 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-03 18:34:27,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-03 18:34:27,894 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 18:34:27,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 18:34:28,168 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 18:34:28,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 18:34:28,573 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-03 18:34:28,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-03 18:34:29,317 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 18:34:29,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 18:34:29,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 18:34:29,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-03-03 18:34:29,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-03-03 18:34:29,682 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 18:34:29,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-03 18:34:29,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-03-03 18:34:29,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 18:34:29,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2022-03-03 18:34:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 1829 trivial. 0 not checked. [2022-03-03 18:34:29,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 18:35:59,060 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-03-03 18:35:59,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2022-03-03 18:35:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1857 trivial. 0 not checked. [2022-03-03 18:35:59,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968330330] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 18:35:59,115 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 18:35:59,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 11] total 39 [2022-03-03 18:35:59,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906975752] [2022-03-03 18:35:59,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 18:35:59,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-03 18:35:59,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:35:59,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-03 18:35:59,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1280, Unknown=7, NotChecked=0, Total=1560 [2022-03-03 18:35:59,117 INFO L87 Difference]: Start difference. First operand 19015 states and 37348 transitions. Second operand has 40 states, 39 states have (on average 15.794871794871796) internal successors, (616), 40 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:36:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:36:06,109 INFO L93 Difference]: Finished difference Result 45235 states and 89758 transitions. [2022-03-03 18:36:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-03 18:36:06,109 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 15.794871794871796) internal successors, (616), 40 states have internal predecessors, (616), 0 states have call successors, (0), 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 566 [2022-03-03 18:36:06,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:36:06,174 INFO L225 Difference]: With dead ends: 45235 [2022-03-03 18:36:06,174 INFO L226 Difference]: Without dead ends: 45235 [2022-03-03 18:36:06,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1265 GetRequests, 1146 SyntacticMatches, 22 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 78.6s TimeCoverageRelationStatistics Valid=2233, Invalid=7462, Unknown=7, NotChecked=0, Total=9702 [2022-03-03 18:36:06,175 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 5215 mSDsluCounter, 6450 mSDsCounter, 0 mSdLazyCounter, 6314 mSolverCounterSat, 788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 7002 SdHoareTripleChecker+Invalid, 10572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 788 IncrementalHoareTripleChecker+Valid, 6314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3470 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-03-03 18:36:06,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5215 Valid, 7002 Invalid, 10572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [788 Valid, 6314 Invalid, 0 Unknown, 3470 Unchecked, 3.8s Time] [2022-03-03 18:36:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45235 states. [2022-03-03 18:36:06,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45235 to 15388. [2022-03-03 18:36:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15388 states, 15333 states have (on average 1.9639339985651862) internal successors, (30113), 15387 states have internal predecessors, (30113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:36:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15388 states to 15388 states and 30113 transitions. [2022-03-03 18:36:06,511 INFO L78 Accepts]: Start accepts. Automaton has 15388 states and 30113 transitions. Word has length 566 [2022-03-03 18:36:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:36:06,511 INFO L470 AbstractCegarLoop]: Abstraction has 15388 states and 30113 transitions. [2022-03-03 18:36:06,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 15.794871794871796) internal successors, (616), 40 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:36:06,512 INFO L276 IsEmpty]: Start isEmpty. Operand 15388 states and 30113 transitions. [2022-03-03 18:36:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2022-03-03 18:36:06,516 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:36:06,516 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:36:06,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-03 18:36:06,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2022-03-03 18:36:06,718 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-03 18:36:06,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:36:06,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1410440418, now seen corresponding path program 3 times [2022-03-03 18:36:06,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:36:06,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290517936] [2022-03-03 18:36:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:36:06,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:36:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:36:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1869 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 1832 trivial. 0 not checked. [2022-03-03 18:36:07,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:36:07,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290517936] [2022-03-03 18:36:07,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290517936] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 18:36:07,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200112677] [2022-03-03 18:36:07,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 18:36:07,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 18:36:07,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:36:07,772 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 18:36:07,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process Received shutdown request... [2022-03-03 18:39:03,611 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 18:39:03,611 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 18:39:04,811 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forcibly destroying the process [2022-03-03 18:39:04,812 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-03-03 18:39:04,845 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 137 [2022-03-03 18:39:04,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 137 [2022-03-03 18:39:04,847 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-03 18:39:04,847 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-03 18:39:04,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-03-03 18:39:04,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350804406] [2022-03-03 18:39:04,847 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-03 18:39:04,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-03 18:39:04,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:39:04,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-03 18:39:04,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-03-03 18:39:04,848 INFO L87 Difference]: Start difference. First operand 15388 states and 30113 transitions. Second operand has 17 states, 16 states have (on average 12.3125) internal successors, (197), 17 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:39:04,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 18:39:04,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-03-03 18:39:04,850 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:39:04,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 18:39:04,850 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2022-03-03 18:39:04,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-03-03 18:39:04,851 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). [2022-03-03 18:39:04,852 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2022-03-03 18:39:04,852 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2022-03-03 18:39:04,852 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2022-03-03 18:39:04,852 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2022-03-03 18:39:04,852 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (12 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2022-03-03 18:39:04,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2022-03-03 18:39:04,854 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2022-03-03 18:39:04,854 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2022-03-03 18:39:04,856 INFO L732 BasicCegarLoop]: Path program histogram: [28, 21, 15, 12, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:39:04,859 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-03 18:39:04,859 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-03 18:39:04,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:39:04 BasicIcfg [2022-03-03 18:39:04,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-03 18:39:04,860 INFO L158 Benchmark]: Toolchain (without parser) took 795605.35ms. Allocated memory was 184.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 132.5MB in the beginning and 787.9MB in the end (delta: -655.5MB). Peak memory consumption was 680.1MB. Max. memory is 8.0GB. [2022-03-03 18:39:04,861 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 18:39:04,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 743.31ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 132.2MB in the beginning and 171.2MB in the end (delta: -39.0MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-03-03 18:39:04,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.86ms. Allocated memory is still 222.3MB. Free memory was 171.2MB in the beginning and 167.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-03-03 18:39:04,861 INFO L158 Benchmark]: Boogie Preprocessor took 53.41ms. Allocated memory is still 222.3MB. Free memory was 167.1MB in the beginning and 163.5MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-03 18:39:04,861 INFO L158 Benchmark]: RCFGBuilder took 741.34ms. Allocated memory is still 222.3MB. Free memory was 163.5MB in the beginning and 135.1MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-03-03 18:39:04,861 INFO L158 Benchmark]: TraceAbstraction took 793975.49ms. Allocated memory was 222.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 134.6MB in the beginning and 787.9MB in the end (delta: -653.3MB). Peak memory consumption was 644.3MB. Max. memory is 8.0GB. [2022-03-03 18:39:04,861 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 743.31ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 132.2MB in the beginning and 171.2MB in the end (delta: -39.0MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 86.86ms. Allocated memory is still 222.3MB. Free memory was 171.2MB in the beginning and 167.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.41ms. Allocated memory is still 222.3MB. Free memory was 167.1MB in the beginning and 163.5MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 741.34ms. Allocated memory is still 222.3MB. Free memory was 163.5MB in the beginning and 135.1MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 793975.49ms. Allocated memory was 222.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 134.6MB in the beginning and 787.9MB in the end (delta: -653.3MB). Peak memory consumption was 644.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1260]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1255]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1236]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1262]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1257]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1244]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1236]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (15388states) and FLOYD_HOARE automaton (currently 2 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 354 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 793.8s, OverallIterations: 101, TraceHistogramMax: 10, PathProgramHistogramMax: 28, EmptinessCheckTime: 0.4s, AutomataDifference: 116.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72746 SdHoareTripleChecker+Valid, 90.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72746 mSDsluCounter, 315122 SdHoareTripleChecker+Invalid, 74.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4151 IncrementalHoareTripleChecker+Unchecked, 253346 mSDsCounter, 5733 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 187576 IncrementalHoareTripleChecker+Invalid, 197460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5733 mSolverCounterUnsat, 61921 mSDtfsCounter, 187576 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8590 GetRequests, 6438 SyntacticMatches, 72 SemanticMatches, 2080 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16733 ImplicationChecksByTransitivity, 113.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19015occurred in iteration=99, InterpolantAutomatonStates: 1798, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.9s AutomataMinimizationTime, 100 MinimizatonAttempts, 490006 StatesRemovedByMinimization, 99 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.6s SsaConstructionTime, 283.4s SatisfiabilityAnalysisTime, 173.9s InterpolantComputationTime, 50262 NumberOfCodeBlocks, 49032 NumberOfCodeBlocksAsserted, 114 NumberOfCheckSat, 51900 ConstructedInterpolants, 639 QuantifiedInterpolants, 216362 SizeOfPredicates, 109 NumberOfNonLiveVariables, 11307 ConjunctsInSsa, 326 ConjunctsInUnsatCore, 117 InterpolantComputations, 95 PerfectInterpolantSequences, 179661/190571 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: Timeout Completed graceful shutdown