/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_10-arraylist_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:14:56,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:14:56,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:14:56,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:14:56,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:14:56,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:14:56,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:14:56,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:14:56,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:14:56,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:14:56,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:14:56,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:14:56,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:14:56,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:14:56,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:14:56,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:14:56,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:14:56,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:14:56,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:14:56,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:14:56,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:14:56,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:14:56,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:14:56,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:14:56,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:14:56,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:14:56,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:14:56,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:14:56,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:14:56,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:14:56,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:14:56,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:14:56,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:14:56,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:14:56,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:14:56,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:14:56,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:14:56,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:14:56,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:14:56,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:14:56,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:14:56,827 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:14:56,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:14:56,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:14:56,840 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:14:56,840 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:14:56,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:14:56,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:14:56,840 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:14:56,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:14:56,841 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:14:56,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:14:56,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:14:56,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:14:56,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:14:56,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:14:56,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:14:56,842 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:14:56,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:14:56,842 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:14:56,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:14:56,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:14:56,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:14:56,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:14:56,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:14:56,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:14:56,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:14:56,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:14:56,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:14:56,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:14:56,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:14:56,843 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:14:56,843 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:14:56,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:14:56,844 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-15 20:14:56,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:14:57,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:14:57,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:14:57,010 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 20:14:57,010 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 20:14:57,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_10-arraylist_rc.i [2022-03-15 20:14:57,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c429e5396/19b1470f9a994307b2bc3d852537abea/FLAG8024e3be1 [2022-03-15 20:14:57,560 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 20:14:57,560 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_10-arraylist_rc.i [2022-03-15 20:14:57,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c429e5396/19b1470f9a994307b2bc3d852537abea/FLAG8024e3be1 [2022-03-15 20:14:58,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c429e5396/19b1470f9a994307b2bc3d852537abea [2022-03-15 20:14:58,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:14:58,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 20:14:58,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 20:14:58,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 20:14:58,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 20:14:58,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:14:58" (1/1) ... [2022-03-15 20:14:58,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d9311c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:14:58, skipping insertion in model container [2022-03-15 20:14:58,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:14:58" (1/1) ... [2022-03-15 20:14:58,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 20:14:58,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 20:14:58,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:14:58,508 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 20:14:58,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:14:58,621 INFO L208 MainTranslator]: Completed translation [2022-03-15 20:14:58,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:14:58 WrapperNode [2022-03-15 20:14:58,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 20:14:58,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:14:58,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:14:58,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:14:58,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:14:58" (1/1) ... [2022-03-15 20:14:58,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:14:58" (1/1) ... [2022-03-15 20:14:58,668 INFO L137 Inliner]: procedures = 371, calls = 35, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 233 [2022-03-15 20:14:58,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:14:58,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:14:58,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:14:58,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:14:58,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:14:58" (1/1) ... [2022-03-15 20:14:58,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:14:58" (1/1) ... [2022-03-15 20:14:58,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:14:58" (1/1) ... [2022-03-15 20:14:58,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:14:58" (1/1) ... [2022-03-15 20:14:58,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:14:58" (1/1) ... [2022-03-15 20:14:58,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:14:58" (1/1) ... [2022-03-15 20:14:58,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:14:58" (1/1) ... [2022-03-15 20:14:58,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:14:58,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:14:58,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:14:58,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:14:58,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:14:58" (1/1) ... [2022-03-15 20:14:58,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:14:58,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:58,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 20:14:58,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 20:14:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 20:14:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-15 20:14:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 20:14:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 20:14:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 20:14:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 20:14:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 20:14:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 20:14:58,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-15 20:14:58,790 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 20:14:58,790 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 20:14:58,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 20:14:58,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:14:58,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:14:58,791 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:14:58,907 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:14:58,908 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:14:59,216 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:14:59,223 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:14:59,224 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-15 20:14:59,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:14:59 BoogieIcfgContainer [2022-03-15 20:14:59,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:14:59,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:14:59,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:14:59,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:14:59,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 08:14:58" (1/3) ... [2022-03-15 20:14:59,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b4deb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:14:59, skipping insertion in model container [2022-03-15 20:14:59,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:14:58" (2/3) ... [2022-03-15 20:14:59,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b4deb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:14:59, skipping insertion in model container [2022-03-15 20:14:59,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:14:59" (3/3) ... [2022-03-15 20:14:59,233 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_10-arraylist_rc.i [2022-03-15 20:14:59,238 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:14:59,238 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:14:59,239 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-03-15 20:14:59,239 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:14:59,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,292 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,294 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,294 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,296 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,296 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,297 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,302 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,302 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,302 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,302 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,302 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,302 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,302 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,302 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,303 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,304 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,304 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,304 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,305 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,306 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,307 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,307 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,307 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,307 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,307 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,307 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,307 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,307 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,309 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,310 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,310 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,310 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,310 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,310 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,310 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,310 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,310 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,317 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,317 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,317 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,317 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,319 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,319 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,319 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,319 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,320 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,320 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,320 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,320 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,321 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,321 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,321 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,321 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,321 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,321 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-15 20:14:59,321 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-15 20:14:59,321 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-15 20:14:59,321 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-15 20:14:59,321 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,322 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-15 20:14:59,322 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-15 20:14:59,322 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-15 20:14:59,322 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-15 20:14:59,322 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-15 20:14:59,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,322 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-15 20:14:59,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,322 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-15 20:14:59,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,322 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-15 20:14:59,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,322 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-15 20:14:59,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,323 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-15 20:14:59,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,323 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-15 20:14:59,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,323 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-15 20:14:59,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,323 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-15 20:14:59,323 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-15 20:14:59,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,323 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-15 20:14:59,323 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-15 20:14:59,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,324 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-15 20:14:59,324 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-15 20:14:59,324 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,324 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,325 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-15 20:14:59,325 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-15 20:14:59,325 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,325 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,325 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,325 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,325 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-15 20:14:59,326 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-15 20:14:59,326 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,326 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,326 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-15 20:14:59,326 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-15 20:14:59,326 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,326 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,326 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,326 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,327 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,327 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,327 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,327 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,327 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,327 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,327 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,327 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,327 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,329 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-15 20:14:59,329 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-15 20:14:59,329 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-15 20:14:59,329 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-15 20:14:59,329 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-15 20:14:59,329 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-15 20:14:59,329 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-15 20:14:59,329 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-15 20:14:59,329 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-15 20:14:59,329 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-15 20:14:59,329 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-15 20:14:59,329 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-15 20:14:59,329 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,329 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,329 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,329 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,330 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,331 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,332 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,333 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,333 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,333 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,333 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,333 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,333 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,333 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,333 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,333 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-15 20:14:59,333 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,336 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-15 20:14:59,336 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,336 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-15 20:14:59,337 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,337 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-15 20:14:59,338 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,338 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,338 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,338 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,338 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,338 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,338 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,338 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,339 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,339 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,339 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,339 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,339 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,339 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,339 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,340 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,341 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,341 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,341 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,341 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,341 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,341 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,341 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,342 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,342 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,345 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,351 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-15 20:14:59,351 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-15 20:14:59,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,351 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-15 20:14:59,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,353 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-15 20:14:59,353 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-15 20:14:59,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,354 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-15 20:14:59,354 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-15 20:14:59,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,354 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-15 20:14:59,355 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,355 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:14:59,357 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 20:14:59,392 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:14:59,396 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:14:59,396 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-03-15 20:14:59,405 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:14:59,411 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 280 transitions, 565 flow [2022-03-15 20:14:59,412 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 280 transitions, 565 flow [2022-03-15 20:14:59,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 280 places, 280 transitions, 565 flow [2022-03-15 20:14:59,517 INFO L129 PetriNetUnfolder]: 4/279 cut-off events. [2022-03-15 20:14:59,518 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 20:14:59,522 INFO L84 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 279 events. 4/279 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 153. Up to 2 conditions per place. [2022-03-15 20:14:59,533 INFO L116 LiptonReduction]: Number of co-enabled transitions 6512 [2022-03-15 20:16:12,493 WARN L228 SmtUtils]: Spent 23.83s on a formula simplification that was a NOOP. DAG size: 219 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:16:27,796 WARN L228 SmtUtils]: Spent 15.30s on a formula simplification that was a NOOP. DAG size: 205 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:17:07,673 WARN L228 SmtUtils]: Spent 39.87s on a formula simplification that was a NOOP. DAG size: 219 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:17:41,295 WARN L228 SmtUtils]: Spent 33.62s on a formula simplification that was a NOOP. DAG size: 205 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:18:47,930 WARN L228 SmtUtils]: Spent 1.11m on a formula simplification that was a NOOP. DAG size: 322 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:19:44,656 WARN L228 SmtUtils]: Spent 56.72s on a formula simplification that was a NOOP. DAG size: 295 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:21:17,781 WARN L228 SmtUtils]: Spent 1.55m on a formula simplification that was a NOOP. DAG size: 328 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:22:20,702 WARN L228 SmtUtils]: Spent 1.05m on a formula simplification that was a NOOP. DAG size: 301 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:22:20,709 INFO L131 LiptonReduction]: Checked pairs total: 45212 [2022-03-15 20:22:20,709 INFO L133 LiptonReduction]: Total number of compositions: 259 [2022-03-15 20:22:20,714 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 81 transitions, 167 flow [2022-03-15 20:22:20,782 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1106 states, 1070 states have (on average 1.9925233644859812) internal successors, (2132), 1105 states have internal predecessors, (2132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 1106 states, 1070 states have (on average 1.9925233644859812) internal successors, (2132), 1105 states have internal predecessors, (2132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-03-15 20:22:20,788 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:22:20,788 INFO L514 BasicCegarLoop]: trace histogram [1, 1] [2022-03-15 20:22:20,788 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:22:20,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:22:20,791 INFO L85 PathProgramCache]: Analyzing trace with hash 29479, now seen corresponding path program 1 times [2022-03-15 20:22:20,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:22:20,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352508418] [2022-03-15 20:22:20,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:20,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:22:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:20,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:20,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:22:20,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352508418] [2022-03-15 20:22:20,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352508418] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:22:20,946 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:22:20,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 20:22:20,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1731663675] [2022-03-15 20:22:20,952 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:22:20,953 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:22:20,958 INFO L252 McrAutomatonBuilder]: Finished intersection with 3 states and 2 transitions. [2022-03-15 20:22:20,958 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:22:20,962 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:22:20,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 20:22:20,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:22:20,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 20:22:20,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:22:20,986 INFO L87 Difference]: Start difference. First operand has 1106 states, 1070 states have (on average 1.9925233644859812) internal successors, (2132), 1105 states have internal predecessors, (2132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:22:21,312 INFO L93 Difference]: Finished difference Result 1097 states and 2123 transitions. [2022-03-15 20:22:21,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 20:22:21,318 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-03-15 20:22:21,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:22:21,334 INFO L225 Difference]: With dead ends: 1097 [2022-03-15 20:22:21,334 INFO L226 Difference]: Without dead ends: 1097 [2022-03-15 20:22:21,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:22:21,337 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:22:21,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:22:21,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-03-15 20:22:21,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2022-03-15 20:22:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1070 states have (on average 1.9841121495327103) internal successors, (2123), 1096 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 2123 transitions. [2022-03-15 20:22:21,415 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 2123 transitions. Word has length 2 [2022-03-15 20:22:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:22:21,415 INFO L470 AbstractCegarLoop]: Abstraction has 1097 states and 2123 transitions. [2022-03-15 20:22:21,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 2123 transitions. [2022-03-15 20:22:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:22:21,416 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:22:21,416 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:22:21,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:22:21,416 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:22:21,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:22:21,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1020195478, now seen corresponding path program 1 times [2022-03-15 20:22:21,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:22:21,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596071456] [2022-03-15 20:22:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:21,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:22:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:21,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:22:21,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596071456] [2022-03-15 20:22:21,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596071456] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:22:21,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:22:21,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:22:21,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2091101121] [2022-03-15 20:22:21,656 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:22:21,657 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:22:21,659 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2022-03-15 20:22:21,659 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:22:21,659 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:22:21,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:22:21,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:22:21,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:22:21,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:22:21,660 INFO L87 Difference]: Start difference. First operand 1097 states and 2123 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:22:22,414 INFO L93 Difference]: Finished difference Result 1098 states and 2124 transitions. [2022-03-15 20:22:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:22:22,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 20:22:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:22:22,418 INFO L225 Difference]: With dead ends: 1098 [2022-03-15 20:22:22,419 INFO L226 Difference]: Without dead ends: 1098 [2022-03-15 20:22:22,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:22:22,423 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:22:22,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:22:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2022-03-15 20:22:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1098. [2022-03-15 20:22:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 1071 states have (on average 1.9831932773109244) internal successors, (2124), 1097 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 2124 transitions. [2022-03-15 20:22:22,447 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 2124 transitions. Word has length 10 [2022-03-15 20:22:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:22:22,447 INFO L470 AbstractCegarLoop]: Abstraction has 1098 states and 2124 transitions. [2022-03-15 20:22:22,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 2124 transitions. [2022-03-15 20:22:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:22:22,448 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:22:22,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:22:22,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:22:22,448 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:22:22,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:22:22,448 INFO L85 PathProgramCache]: Analyzing trace with hash -324607759, now seen corresponding path program 1 times [2022-03-15 20:22:22,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:22:22,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871546663] [2022-03-15 20:22:22,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:22,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:22:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:22,592 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-15 20:22:22,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:22:22,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871546663] [2022-03-15 20:22:22,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871546663] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:22:22,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842911495] [2022-03-15 20:22:22,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:22,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:22,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:22:22,594 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-15 20:22:22,595 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-15 20:22:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:22,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 20:22:22,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:22:22,931 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-15 20:22:22,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:22:22,954 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-15 20:22:22,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842911495] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:22:22,954 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:22:22,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-03-15 20:22:22,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [153906579] [2022-03-15 20:22:22,954 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:22:22,955 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:22:22,956 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:22:22,956 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:22:22,957 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:22:22,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:22:22,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:22:22,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:22:22,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:22:22,957 INFO L87 Difference]: Start difference. First operand 1098 states and 2124 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:22:24,826 INFO L93 Difference]: Finished difference Result 1099 states and 2125 transitions. [2022-03-15 20:22:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 20:22:24,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-03-15 20:22:24,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:22:24,829 INFO L225 Difference]: With dead ends: 1099 [2022-03-15 20:22:24,829 INFO L226 Difference]: Without dead ends: 1099 [2022-03-15 20:22:24,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:22:24,830 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:22:24,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:22:24,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2022-03-15 20:22:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2022-03-15 20:22:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1072 states have (on average 1.982276119402985) internal successors, (2125), 1098 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 2125 transitions. [2022-03-15 20:22:24,848 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 2125 transitions. Word has length 11 [2022-03-15 20:22:24,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:22:24,848 INFO L470 AbstractCegarLoop]: Abstraction has 1099 states and 2125 transitions. [2022-03-15 20:22:24,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 2125 transitions. [2022-03-15 20:22:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:22:24,848 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:22:24,848 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:22:24,872 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-15 20:22:25,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:25,067 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:22:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:22:25,068 INFO L85 PathProgramCache]: Analyzing trace with hash 936164854, now seen corresponding path program 2 times [2022-03-15 20:22:25,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:22:25,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774827724] [2022-03-15 20:22:25,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:25,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:22:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:25,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:22:25,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774827724] [2022-03-15 20:22:25,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774827724] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:22:25,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869068689] [2022-03-15 20:22:25,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:22:25,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:25,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:22:25,191 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-15 20:22:25,192 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-15 20:22:25,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:22:25,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:22:25,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:22:25,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:22:25,565 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-15 20:22:25,580 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-15 20:22:25,581 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 28 treesize of output 27 [2022-03-15 20:22:25,605 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-15 20:22:25,606 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 40 treesize of output 42 [2022-03-15 20:22:25,643 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-15 20:22:25,643 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 52 treesize of output 57 [2022-03-15 20:22:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:22:25,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:22:25,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869068689] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:22:25,661 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:22:25,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2022-03-15 20:22:25,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1250497717] [2022-03-15 20:22:25,661 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:22:25,662 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:22:25,663 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2022-03-15 20:22:25,663 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:22:25,663 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:22:25,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:22:25,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:22:25,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:22:25,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:22:25,664 INFO L87 Difference]: Start difference. First operand 1099 states and 2125 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:22:27,843 INFO L93 Difference]: Finished difference Result 1929 states and 3724 transitions. [2022-03-15 20:22:27,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:22:27,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 12 [2022-03-15 20:22:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:22:27,849 INFO L225 Difference]: With dead ends: 1929 [2022-03-15 20:22:27,849 INFO L226 Difference]: Without dead ends: 1929 [2022-03-15 20:22:27,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:22:27,850 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 85 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:22:27,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 46 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 20:22:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2022-03-15 20:22:27,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1255. [2022-03-15 20:22:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1228 states have (on average 1.981270358306189) internal successors, (2433), 1254 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 2433 transitions. [2022-03-15 20:22:27,873 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 2433 transitions. Word has length 12 [2022-03-15 20:22:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:22:27,873 INFO L470 AbstractCegarLoop]: Abstraction has 1255 states and 2433 transitions. [2022-03-15 20:22:27,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 2433 transitions. [2022-03-15 20:22:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:22:27,874 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:22:27,874 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:22:27,894 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-15 20:22:28,095 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,SelfDestructingSolverStorable3 [2022-03-15 20:22:28,095 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:22:28,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:22:28,096 INFO L85 PathProgramCache]: Analyzing trace with hash 399411081, now seen corresponding path program 1 times [2022-03-15 20:22:28,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:22:28,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348754024] [2022-03-15 20:22:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:28,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:22:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:28,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:22:28,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348754024] [2022-03-15 20:22:28,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348754024] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:22:28,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088571615] [2022-03-15 20:22:28,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:28,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:28,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:22:28,231 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-15 20:22:28,232 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-15 20:22:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:28,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:22:28,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:22:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:28,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:22:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:28,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088571615] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:22:28,658 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:22:28,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 20:22:28,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1234711873] [2022-03-15 20:22:28,658 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:22:28,660 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:22:28,661 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2022-03-15 20:22:28,661 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:22:28,661 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:22:28,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 20:22:28,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:22:28,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 20:22:28,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:22:28,662 INFO L87 Difference]: Start difference. First operand 1255 states and 2433 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:30,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:22:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:22:30,476 INFO L93 Difference]: Finished difference Result 1256 states and 2434 transitions. [2022-03-15 20:22:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:22:30,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-03-15 20:22:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:22:30,480 INFO L225 Difference]: With dead ends: 1256 [2022-03-15 20:22:30,480 INFO L226 Difference]: Without dead ends: 1256 [2022-03-15 20:22:30,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-03-15 20:22:30,481 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:22:30,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 20:22:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2022-03-15 20:22:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2022-03-15 20:22:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1229 states have (on average 1.9804719283970709) internal successors, (2434), 1255 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2434 transitions. [2022-03-15 20:22:30,499 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2434 transitions. Word has length 13 [2022-03-15 20:22:30,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:22:30,500 INFO L470 AbstractCegarLoop]: Abstraction has 1256 states and 2434 transitions. [2022-03-15 20:22:30,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2434 transitions. [2022-03-15 20:22:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:22:30,501 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:22:30,501 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:22:30,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 20:22:30,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:30,720 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:22:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:22:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 821114702, now seen corresponding path program 2 times [2022-03-15 20:22:30,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:22:30,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704495762] [2022-03-15 20:22:30,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:30,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:22:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:22:30,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:22:30,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704495762] [2022-03-15 20:22:30,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704495762] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:22:30,939 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:22:30,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:22:30,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1056509091] [2022-03-15 20:22:30,940 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:22:30,942 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:22:30,944 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2022-03-15 20:22:30,944 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:22:30,944 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:22:30,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:22:30,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:22:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:22:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:22:30,944 INFO L87 Difference]: Start difference. First operand 1256 states and 2434 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:32,952 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:22:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:22:33,192 INFO L93 Difference]: Finished difference Result 1340 states and 2598 transitions. [2022-03-15 20:22:33,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:22:33,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 14 [2022-03-15 20:22:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:22:33,197 INFO L225 Difference]: With dead ends: 1340 [2022-03-15 20:22:33,198 INFO L226 Difference]: Without dead ends: 1340 [2022-03-15 20:22:33,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:22:33,198 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 48 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:22:33,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 62 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 387 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 20:22:33,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2022-03-15 20:22:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2022-03-15 20:22:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1313 states have (on average 1.9786747905559787) internal successors, (2598), 1339 states have internal predecessors, (2598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 2598 transitions. [2022-03-15 20:22:33,218 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 2598 transitions. Word has length 14 [2022-03-15 20:22:33,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:22:33,218 INFO L470 AbstractCegarLoop]: Abstraction has 1340 states and 2598 transitions. [2022-03-15 20:22:33,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 2598 transitions. [2022-03-15 20:22:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:22:33,222 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:22:33,222 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:22:33,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:22:33,222 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:22:33,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:22:33,223 INFO L85 PathProgramCache]: Analyzing trace with hash 169751905, now seen corresponding path program 1 times [2022-03-15 20:22:33,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:22:33,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107031573] [2022-03-15 20:22:33,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:33,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:22:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:33,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:22:33,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107031573] [2022-03-15 20:22:33,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107031573] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:22:33,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841836508] [2022-03-15 20:22:33,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:33,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:33,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:22:33,346 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-15 20:22:33,347 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-15 20:22:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:33,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:22:33,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:22:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:33,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:22:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:33,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841836508] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:22:33,938 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:22:33,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 20:22:33,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2080516644] [2022-03-15 20:22:33,939 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:22:33,941 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:22:33,946 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 45 transitions. [2022-03-15 20:22:33,946 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:22:34,044 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:22:34,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:22:34,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:22:34,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:22:34,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:22:34,045 INFO L87 Difference]: Start difference. First operand 1340 states and 2598 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:22:35,075 INFO L93 Difference]: Finished difference Result 1341 states and 2599 transitions. [2022-03-15 20:22:35,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:22:35,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 20:22:35,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:22:35,079 INFO L225 Difference]: With dead ends: 1341 [2022-03-15 20:22:35,079 INFO L226 Difference]: Without dead ends: 1341 [2022-03-15 20:22:35,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:22:35,080 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:22:35,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:22:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2022-03-15 20:22:35,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1341. [2022-03-15 20:22:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1314 states have (on average 1.9779299847793) internal successors, (2599), 1340 states have internal predecessors, (2599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 2599 transitions. [2022-03-15 20:22:35,103 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 2599 transitions. Word has length 17 [2022-03-15 20:22:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:22:35,103 INFO L470 AbstractCegarLoop]: Abstraction has 1341 states and 2599 transitions. [2022-03-15 20:22:35,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 2599 transitions. [2022-03-15 20:22:35,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:22:35,104 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:22:35,104 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:22:35,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 20:22:35,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:35,323 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:22:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:22:35,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1864989350, now seen corresponding path program 2 times [2022-03-15 20:22:35,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:22:35,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761404796] [2022-03-15 20:22:35,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:35,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:22:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:35,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:22:35,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761404796] [2022-03-15 20:22:35,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761404796] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:22:35,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160149845] [2022-03-15 20:22:35,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:22:35,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:35,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:22:35,476 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-15 20:22:35,477 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-15 20:22:35,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:22:35,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:22:35,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 20:22:35,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:22:36,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:22:36,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:22:36,096 INFO L353 Elim1Store]: treesize reduction 105, result has 21.1 percent of original size [2022-03-15 20:22:36,096 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 53 [2022-03-15 20:22:36,324 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-15 20:22:36,381 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-15 20:22:36,381 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 28 treesize of output 27 [2022-03-15 20:22:36,464 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-15 20:22:36,464 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 40 treesize of output 42 [2022-03-15 20:22:36,560 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-15 20:22:36,561 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 52 treesize of output 57 [2022-03-15 20:22:36,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:22:36,692 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-03-15 20:22:36,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-03-15 20:22:36,772 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 20:22:36,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2022-03-15 20:22:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 20:22:36,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:22:36,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160149845] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:22:36,794 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:22:36,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 14 [2022-03-15 20:22:36,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [498817120] [2022-03-15 20:22:36,794 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:22:36,797 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:22:36,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2022-03-15 20:22:36,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:22:36,894 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:36,894 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:36,899 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:36,899 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:36,984 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:36,984 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:36,987 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:36,987 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:37,066 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:37,067 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:37,070 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:37,070 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:37,557 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [29002#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 29003#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 29004#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 29001#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))] [2022-03-15 20:22:37,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:22:37,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:22:37,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:22:37,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-03-15 20:22:37,558 INFO L87 Difference]: Start difference. First operand 1341 states and 2599 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:22:38,355 INFO L93 Difference]: Finished difference Result 1421 states and 2757 transitions. [2022-03-15 20:22:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:22:38,356 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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 18 [2022-03-15 20:22:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:22:38,360 INFO L225 Difference]: With dead ends: 1421 [2022-03-15 20:22:38,360 INFO L226 Difference]: Without dead ends: 1421 [2022-03-15 20:22:38,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-03-15 20:22:38,361 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 44 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:22:38,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 168 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 203 Invalid, 0 Unknown, 53 Unchecked, 0.8s Time] [2022-03-15 20:22:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2022-03-15 20:22:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1345. [2022-03-15 20:22:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1318 states have (on average 1.9779969650986342) internal successors, (2607), 1344 states have internal predecessors, (2607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 2607 transitions. [2022-03-15 20:22:38,378 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 2607 transitions. Word has length 18 [2022-03-15 20:22:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:22:38,378 INFO L470 AbstractCegarLoop]: Abstraction has 1345 states and 2607 transitions. [2022-03-15 20:22:38,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2607 transitions. [2022-03-15 20:22:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:22:38,379 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:22:38,379 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:22:38,398 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-15 20:22:38,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:38,595 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:22:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:22:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash 863611652, now seen corresponding path program 3 times [2022-03-15 20:22:38,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:22:38,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399372530] [2022-03-15 20:22:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:38,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:22:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:38,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:22:38,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399372530] [2022-03-15 20:22:38,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399372530] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:22:38,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410960950] [2022-03-15 20:22:38,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:22:38,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:38,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:22:38,756 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-15 20:22:38,757 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-15 20:22:39,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 20:22:39,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:22:39,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 20:22:39,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:22:39,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:22:39,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:22:39,413 INFO L353 Elim1Store]: treesize reduction 81, result has 19.8 percent of original size [2022-03-15 20:22:39,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2022-03-15 20:22:39,518 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-15 20:22:39,563 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-15 20:22:39,564 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 28 treesize of output 27 [2022-03-15 20:22:39,619 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-15 20:22:39,620 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 40 treesize of output 42 [2022-03-15 20:22:39,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:22:39,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:22:39,707 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 20:22:39,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 21 [2022-03-15 20:22:39,771 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-15 20:22:39,771 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 52 treesize of output 57 [2022-03-15 20:22:39,810 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 20:22:39,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2022-03-15 20:22:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 20:22:39,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:22:39,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410960950] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:22:39,835 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:22:39,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 14 [2022-03-15 20:22:39,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [977769814] [2022-03-15 20:22:39,835 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:22:39,837 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:22:39,841 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2022-03-15 20:22:39,841 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:22:39,866 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:39,866 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:39,868 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:39,869 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:40,076 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:40,077 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:40,079 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:40,079 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:40,212 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:40,212 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:40,215 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:40,215 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:40,454 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [33182#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 33184#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 33183#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))] [2022-03-15 20:22:40,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:22:40,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:22:40,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:22:40,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:22:40,455 INFO L87 Difference]: Start difference. First operand 1345 states and 2607 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:42,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:22:42,060 INFO L93 Difference]: Finished difference Result 2455 states and 4730 transitions. [2022-03-15 20:22:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:22:42,060 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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 18 [2022-03-15 20:22:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:22:42,067 INFO L225 Difference]: With dead ends: 2455 [2022-03-15 20:22:42,067 INFO L226 Difference]: Without dead ends: 2455 [2022-03-15 20:22:42,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-03-15 20:22:42,068 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 99 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:22:42,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 96 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 410 Invalid, 0 Unknown, 279 Unchecked, 1.6s Time] [2022-03-15 20:22:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2022-03-15 20:22:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 1372. [2022-03-15 20:22:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1345 states have (on average 1.979182156133829) internal successors, (2662), 1371 states have internal predecessors, (2662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2662 transitions. [2022-03-15 20:22:42,089 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2662 transitions. Word has length 18 [2022-03-15 20:22:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:22:42,089 INFO L470 AbstractCegarLoop]: Abstraction has 1372 states and 2662 transitions. [2022-03-15 20:22:42,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:42,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2662 transitions. [2022-03-15 20:22:42,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:22:42,090 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:22:42,090 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:22:42,113 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-15 20:22:42,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:42,311 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:22:42,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:22:42,311 INFO L85 PathProgramCache]: Analyzing trace with hash 533335172, now seen corresponding path program 4 times [2022-03-15 20:22:42,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:22:42,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385042381] [2022-03-15 20:22:42,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:42,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:22:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:42,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:22:42,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385042381] [2022-03-15 20:22:42,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385042381] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:22:42,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324720280] [2022-03-15 20:22:42,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:22:42,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:42,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:22:42,452 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-15 20:22:42,453 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-15 20:22:46,347 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:22:46,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:22:46,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:22:46,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:22:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:46,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:22:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:46,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324720280] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:22:46,435 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:22:46,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-03-15 20:22:46,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1894313186] [2022-03-15 20:22:46,435 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:22:46,437 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:22:46,441 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2022-03-15 20:22:46,441 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:22:46,497 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:22:46,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:22:46,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:22:46,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:22:46,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:22:46,498 INFO L87 Difference]: Start difference. First operand 1372 states and 2662 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:22:48,552 INFO L93 Difference]: Finished difference Result 1373 states and 2663 transitions. [2022-03-15 20:22:48,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:22:48,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-03-15 20:22:48,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:22:48,557 INFO L225 Difference]: With dead ends: 1373 [2022-03-15 20:22:48,557 INFO L226 Difference]: Without dead ends: 1373 [2022-03-15 20:22:48,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:22:48,557 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:22:48,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 20:22:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2022-03-15 20:22:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1373. [2022-03-15 20:22:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1346 states have (on average 1.9784546805349184) internal successors, (2663), 1372 states have internal predecessors, (2663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2663 transitions. [2022-03-15 20:22:48,573 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2663 transitions. Word has length 18 [2022-03-15 20:22:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:22:48,573 INFO L470 AbstractCegarLoop]: Abstraction has 1373 states and 2663 transitions. [2022-03-15 20:22:48,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2663 transitions. [2022-03-15 20:22:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:22:48,574 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:22:48,574 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:22:48,596 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-15 20:22:48,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:48,787 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:22:48,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:22:48,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1546088415, now seen corresponding path program 5 times [2022-03-15 20:22:48,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:22:48,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386600989] [2022-03-15 20:22:48,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:48,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:22:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:48,912 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:22:48,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386600989] [2022-03-15 20:22:48,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386600989] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:22:48,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709947119] [2022-03-15 20:22:48,913 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:22:48,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:48,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:22:48,914 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-15 20:22:48,915 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-15 20:22:49,558 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 20:22:49,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:22:49,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:22:49,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:22:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:49,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:22:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:49,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709947119] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:22:49,672 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:22:49,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 20:22:49,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2110360805] [2022-03-15 20:22:49,673 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:22:49,674 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:22:49,679 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 47 transitions. [2022-03-15 20:22:49,679 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:22:49,743 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:22:49,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:22:49,744 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:22:49,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:22:49,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:22:49,744 INFO L87 Difference]: Start difference. First operand 1373 states and 2663 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:22:50,992 INFO L93 Difference]: Finished difference Result 1374 states and 2664 transitions. [2022-03-15 20:22:50,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:22:50,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-03-15 20:22:50,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:22:50,995 INFO L225 Difference]: With dead ends: 1374 [2022-03-15 20:22:50,995 INFO L226 Difference]: Without dead ends: 1374 [2022-03-15 20:22:50,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:22:50,996 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:22:50,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 20:22:50,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-03-15 20:22:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2022-03-15 20:22:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1347 states have (on average 1.977728285077951) internal successors, (2664), 1373 states have internal predecessors, (2664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2664 transitions. [2022-03-15 20:22:51,012 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2664 transitions. Word has length 19 [2022-03-15 20:22:51,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:22:51,012 INFO L470 AbstractCegarLoop]: Abstraction has 1374 states and 2664 transitions. [2022-03-15 20:22:51,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2664 transitions. [2022-03-15 20:22:51,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:22:51,012 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:22:51,013 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:22:51,048 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-15 20:22:51,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 20:22:51,233 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:22:51,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:22:51,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1418299420, now seen corresponding path program 6 times [2022-03-15 20:22:51,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:22:51,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470859222] [2022-03-15 20:22:51,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:51,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:22:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:51,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:22:51,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470859222] [2022-03-15 20:22:51,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470859222] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:22:51,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696524767] [2022-03-15 20:22:51,369 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:22:51,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:51,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:22:51,370 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-15 20:22:51,371 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-15 20:22:52,073 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 20:22:52,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:22:52,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:22:52,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:22:52,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:22:52,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:22:52,161 INFO L353 Elim1Store]: treesize reduction 81, result has 25.7 percent of original size [2022-03-15 20:22:52,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 42 [2022-03-15 20:22:52,229 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-15 20:22:52,259 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-15 20:22:52,259 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 28 treesize of output 27 [2022-03-15 20:22:52,302 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-15 20:22:52,303 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 40 treesize of output 42 [2022-03-15 20:22:52,371 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-15 20:22:52,372 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 52 treesize of output 57 [2022-03-15 20:22:52,416 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-15 20:22:52,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 20:22:52,460 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 54 treesize of output 50 [2022-03-15 20:22:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 20:22:52,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:22:52,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696524767] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:22:52,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:22:52,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 16 [2022-03-15 20:22:52,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [869674545] [2022-03-15 20:22:52,484 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:22:52,486 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:22:52,491 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2022-03-15 20:22:52,491 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:22:52,594 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:52,594 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:52,598 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:52,598 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:52,628 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:52,629 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:52,631 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:52,631 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:52,737 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:52,738 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:52,740 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:52,740 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:52,954 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [46938#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 46940#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|)), 46939#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 46937#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))] [2022-03-15 20:22:52,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:22:52,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:22:52,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:22:52,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:22:52,955 INFO L87 Difference]: Start difference. First operand 1374 states and 2664 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:22:54,312 INFO L93 Difference]: Finished difference Result 1525 states and 2962 transitions. [2022-03-15 20:22:54,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:22:54,313 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 20 [2022-03-15 20:22:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:22:54,317 INFO L225 Difference]: With dead ends: 1525 [2022-03-15 20:22:54,318 INFO L226 Difference]: Without dead ends: 1525 [2022-03-15 20:22:54,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:22:54,318 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 46 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:22:54,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 85 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 339 Invalid, 0 Unknown, 100 Unchecked, 1.3s Time] [2022-03-15 20:22:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2022-03-15 20:22:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1375. [2022-03-15 20:22:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1348 states have (on average 1.9777448071216617) internal successors, (2666), 1374 states have internal predecessors, (2666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2666 transitions. [2022-03-15 20:22:54,335 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2666 transitions. Word has length 20 [2022-03-15 20:22:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:22:54,335 INFO L470 AbstractCegarLoop]: Abstraction has 1375 states and 2666 transitions. [2022-03-15 20:22:54,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2666 transitions. [2022-03-15 20:22:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:22:54,336 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:22:54,336 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:22:54,358 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-15 20:22:54,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:54,556 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:22:54,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:22:54,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1353949736, now seen corresponding path program 7 times [2022-03-15 20:22:54,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:22:54,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923250295] [2022-03-15 20:22:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:54,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:22:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:54,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:22:54,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923250295] [2022-03-15 20:22:54,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923250295] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:22:54,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766335169] [2022-03-15 20:22:54,672 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:22:54,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:54,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:22:54,673 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-15 20:22:54,675 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-15 20:22:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:55,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:22:55,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:22:55,464 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:55,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:22:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:55,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766335169] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:22:55,520 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:22:55,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-03-15 20:22:55,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [291408163] [2022-03-15 20:22:55,521 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:22:55,522 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:22:55,528 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2022-03-15 20:22:55,528 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:22:55,546 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:55,547 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:55,549 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:22:55,549 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:22:55,605 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:22:55,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:22:55,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:22:55,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:22:55,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:22:55,606 INFO L87 Difference]: Start difference. First operand 1375 states and 2666 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:58,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:22:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:22:58,771 INFO L93 Difference]: Finished difference Result 1376 states and 2667 transitions. [2022-03-15 20:22:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:22:58,772 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-03-15 20:22:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:22:58,776 INFO L225 Difference]: With dead ends: 1376 [2022-03-15 20:22:58,776 INFO L226 Difference]: Without dead ends: 1376 [2022-03-15 20:22:58,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:22:58,776 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:22:58,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-03-15 20:22:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2022-03-15 20:22:58,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2022-03-15 20:22:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1349 states have (on average 1.9770200148257968) internal successors, (2667), 1375 states have internal predecessors, (2667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2667 transitions. [2022-03-15 20:22:58,792 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2667 transitions. Word has length 20 [2022-03-15 20:22:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:22:58,792 INFO L470 AbstractCegarLoop]: Abstraction has 1376 states and 2667 transitions. [2022-03-15 20:22:58,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:22:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2667 transitions. [2022-03-15 20:22:58,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:22:58,792 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:22:58,793 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:22:58,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 20:22:58,993 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,SelfDestructingSolverStorable12 [2022-03-15 20:22:58,993 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:22:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:22:58,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1239307891, now seen corresponding path program 8 times [2022-03-15 20:22:58,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:22:58,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253432600] [2022-03-15 20:22:58,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:22:58,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:22:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:22:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:22:59,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:22:59,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253432600] [2022-03-15 20:22:59,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253432600] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:22:59,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162711824] [2022-03-15 20:22:59,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:22:59,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:22:59,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:22:59,120 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-15 20:22:59,121 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-15 20:23:00,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:23:00,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:23:00,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 20:23:00,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:00,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,138 INFO L353 Elim1Store]: treesize reduction 81, result has 25.7 percent of original size [2022-03-15 20:23:00,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 42 [2022-03-15 20:23:00,250 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-15 20:23:00,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,289 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-15 20:23:00,361 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-15 20:23:00,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 20:23:00,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,420 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-15 20:23:00,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,462 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-15 20:23:00,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:00,531 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-15 20:23:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 20:23:00,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:23:00,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162711824] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:00,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:23:00,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 17 [2022-03-15 20:23:00,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2022956621] [2022-03-15 20:23:00,563 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:00,565 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:00,571 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 49 transitions. [2022-03-15 20:23:00,571 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:00,577 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:00,578 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:00,584 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:00,584 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:00,634 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:00,634 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:00,635 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:00,635 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:01,002 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:01,002 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:01,004 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:01,004 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:01,260 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [55551#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (<= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|) (= 3 |~#slot~0.base|) (<= 0 |~#slot~0.offset|) (< |ULTIMATE.start_main_~j~0#1| 10)), 55550#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (<= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|) (= 3 |~#slot~0.base|) (<= 0 |~#slot~0.offset|) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0) (< |ULTIMATE.start_main_~j~0#1| 10))] [2022-03-15 20:23:01,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:23:01,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:01,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:23:01,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:23:01,261 INFO L87 Difference]: Start difference. First operand 1376 states and 2667 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:02,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:02,941 INFO L93 Difference]: Finished difference Result 2532 states and 4881 transitions. [2022-03-15 20:23:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:23:02,942 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 20:23:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:02,948 INFO L225 Difference]: With dead ends: 2532 [2022-03-15 20:23:02,949 INFO L226 Difference]: Without dead ends: 2532 [2022-03-15 20:23:02,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:23:02,949 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 96 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 344 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:02,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 178 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 697 Invalid, 0 Unknown, 344 Unchecked, 1.6s Time] [2022-03-15 20:23:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2022-03-15 20:23:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 1392. [2022-03-15 20:23:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1365 states have (on average 1.978021978021978) internal successors, (2700), 1391 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2700 transitions. [2022-03-15 20:23:02,981 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2700 transitions. Word has length 21 [2022-03-15 20:23:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:02,982 INFO L470 AbstractCegarLoop]: Abstraction has 1392 states and 2700 transitions. [2022-03-15 20:23:02,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2700 transitions. [2022-03-15 20:23:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:23:02,984 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:02,984 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:03,005 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-15 20:23:03,205 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,SelfDestructingSolverStorable13 [2022-03-15 20:23:03,205 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:03,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:03,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1124312397, now seen corresponding path program 9 times [2022-03-15 20:23:03,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:03,207 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304148532] [2022-03-15 20:23:03,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:03,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:03,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:03,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304148532] [2022-03-15 20:23:03,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304148532] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:03,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417369597] [2022-03-15 20:23:03,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:23:03,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:03,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:03,330 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-15 20:23:03,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 20:23:04,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 20:23:04,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:23:04,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-15 20:23:04,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:04,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:04,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:04,357 INFO L353 Elim1Store]: treesize reduction 105, result has 21.1 percent of original size [2022-03-15 20:23:04,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 53 [2022-03-15 20:23:04,495 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-15 20:23:04,550 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-15 20:23:04,550 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 28 treesize of output 27 [2022-03-15 20:23:04,660 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-15 20:23:04,660 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 40 treesize of output 42 [2022-03-15 20:23:04,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:04,748 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-03-15 20:23:04,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-03-15 20:23:04,819 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-15 20:23:04,819 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 52 treesize of output 57 [2022-03-15 20:23:04,862 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 20:23:04,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2022-03-15 20:23:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 20:23:04,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:23:04,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417369597] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:04,885 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:23:04,885 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 17 [2022-03-15 20:23:04,885 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [586150890] [2022-03-15 20:23:04,885 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:04,887 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:04,893 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 49 transitions. [2022-03-15 20:23:04,893 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:04,956 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:04,957 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:04,958 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:04,959 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:05,021 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:05,023 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:05,025 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:05,026 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:05,069 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:05,069 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:05,083 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:05,084 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:05,450 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [60949#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 60950#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 60948#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))] [2022-03-15 20:23:05,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:23:05,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:05,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:23:05,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:23:05,450 INFO L87 Difference]: Start difference. First operand 1392 states and 2700 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:06,644 INFO L93 Difference]: Finished difference Result 2608 states and 5033 transitions. [2022-03-15 20:23:06,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:23:06,648 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 20:23:06,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:06,662 INFO L225 Difference]: With dead ends: 2608 [2022-03-15 20:23:06,663 INFO L226 Difference]: Without dead ends: 2608 [2022-03-15 20:23:06,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:23:06,663 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 136 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:06,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 132 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 572 Invalid, 0 Unknown, 207 Unchecked, 1.2s Time] [2022-03-15 20:23:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2022-03-15 20:23:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 1393. [2022-03-15 20:23:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1366 states have (on average 1.9780380673499267) internal successors, (2702), 1392 states have internal predecessors, (2702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:06,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 2702 transitions. [2022-03-15 20:23:06,686 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 2702 transitions. Word has length 21 [2022-03-15 20:23:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:06,686 INFO L470 AbstractCegarLoop]: Abstraction has 1393 states and 2702 transitions. [2022-03-15 20:23:06,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 2702 transitions. [2022-03-15 20:23:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:23:06,688 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:06,688 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:06,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 20:23:06,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 20:23:06,909 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:06,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1454588877, now seen corresponding path program 10 times [2022-03-15 20:23:06,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:06,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591532982] [2022-03-15 20:23:06,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:06,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:07,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:07,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591532982] [2022-03-15 20:23:07,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591532982] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:07,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601857072] [2022-03-15 20:23:07,126 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:23:07,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:07,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:07,147 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:23:07,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 20:23:09,548 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:23:09,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:23:09,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:23:09,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:09,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:23:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:09,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601857072] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:23:09,636 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:23:09,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-03-15 20:23:09,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1004133707] [2022-03-15 20:23:09,636 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:09,638 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:09,644 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 49 transitions. [2022-03-15 20:23:09,644 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:09,770 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:09,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:23:09,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:09,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:23:09,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:23:09,771 INFO L87 Difference]: Start difference. First operand 1393 states and 2702 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:11,493 INFO L93 Difference]: Finished difference Result 1394 states and 2703 transitions. [2022-03-15 20:23:11,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:23:11,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 20:23:11,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:11,496 INFO L225 Difference]: With dead ends: 1394 [2022-03-15 20:23:11,496 INFO L226 Difference]: Without dead ends: 1394 [2022-03-15 20:23:11,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:23:11,497 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:11,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 20:23:11,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2022-03-15 20:23:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2022-03-15 20:23:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1367 states have (on average 1.9773226042428675) internal successors, (2703), 1393 states have internal predecessors, (2703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2703 transitions. [2022-03-15 20:23:11,536 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2703 transitions. Word has length 21 [2022-03-15 20:23:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:11,536 INFO L470 AbstractCegarLoop]: Abstraction has 1394 states and 2703 transitions. [2022-03-15 20:23:11,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2703 transitions. [2022-03-15 20:23:11,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:23:11,537 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:11,537 INFO L514 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:11,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-15 20:23:11,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 20:23:11,739 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:11,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1626986232, now seen corresponding path program 11 times [2022-03-15 20:23:11,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:11,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120568521] [2022-03-15 20:23:11,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:11,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:11,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:11,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120568521] [2022-03-15 20:23:11,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120568521] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:11,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427345796] [2022-03-15 20:23:11,895 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:23:11,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:11,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:11,896 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:23:11,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 20:23:12,973 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 20:23:12,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:23:12,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:23:12,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:13,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:23:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:13,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427345796] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:23:13,060 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:23:13,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2022-03-15 20:23:13,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [643013857] [2022-03-15 20:23:13,061 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:13,063 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:13,069 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 50 transitions. [2022-03-15 20:23:13,069 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:13,114 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:13,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:23:13,115 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:13,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:23:13,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:23:13,115 INFO L87 Difference]: Start difference. First operand 1394 states and 2703 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:14,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:23:14,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:14,950 INFO L93 Difference]: Finished difference Result 1395 states and 2704 transitions. [2022-03-15 20:23:14,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:23:14,950 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 20:23:14,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:14,952 INFO L225 Difference]: With dead ends: 1395 [2022-03-15 20:23:14,952 INFO L226 Difference]: Without dead ends: 1395 [2022-03-15 20:23:14,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:23:14,953 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:14,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 20:23:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2022-03-15 20:23:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1395. [2022-03-15 20:23:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1368 states have (on average 1.976608187134503) internal successors, (2704), 1394 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 2704 transitions. [2022-03-15 20:23:14,983 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 2704 transitions. Word has length 22 [2022-03-15 20:23:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:14,983 INFO L470 AbstractCegarLoop]: Abstraction has 1395 states and 2704 transitions. [2022-03-15 20:23:14,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 2704 transitions. [2022-03-15 20:23:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:23:14,983 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:14,984 INFO L514 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:15,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 20:23:15,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:15,199 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:15,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1628433197, now seen corresponding path program 12 times [2022-03-15 20:23:15,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:15,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603085421] [2022-03-15 20:23:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:15,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:15,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603085421] [2022-03-15 20:23:15,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603085421] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:15,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219422417] [2022-03-15 20:23:15,417 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:23:15,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:15,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:15,440 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:23:15,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 20:23:16,468 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 20:23:16,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:23:16,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:23:16,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:16,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:16,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:16,603 INFO L353 Elim1Store]: treesize reduction 77, result has 23.8 percent of original size [2022-03-15 20:23:16,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 35 [2022-03-15 20:23:16,670 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-15 20:23:16,695 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-15 20:23:16,695 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 28 treesize of output 27 [2022-03-15 20:23:16,760 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-15 20:23:16,760 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 40 treesize of output 42 [2022-03-15 20:23:16,822 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-15 20:23:16,822 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 52 treesize of output 57 [2022-03-15 20:23:16,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:23:16,874 INFO L353 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-03-15 20:23:16,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 14 [2022-03-15 20:23:16,931 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 20:23:16,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2022-03-15 20:23:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:23:16,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:23:16,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219422417] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:16,953 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:23:16,953 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 19 [2022-03-15 20:23:16,953 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1839212990] [2022-03-15 20:23:16,953 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:16,956 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:16,962 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 51 transitions. [2022-03-15 20:23:16,962 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:17,127 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:17,128 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:17,130 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:17,131 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:17,168 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:17,171 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:17,173 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:17,173 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:17,279 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:17,279 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:17,281 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:17,282 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:17,566 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [75072#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 75075#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 75074#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 75073#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| 3)) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))] [2022-03-15 20:23:17,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:23:17,567 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:17,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:23:17,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:23:17,567 INFO L87 Difference]: Start difference. First operand 1395 states and 2704 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:18,557 INFO L93 Difference]: Finished difference Result 1619 states and 3147 transitions. [2022-03-15 20:23:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:23:18,559 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 20:23:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:18,561 INFO L225 Difference]: With dead ends: 1619 [2022-03-15 20:23:18,561 INFO L226 Difference]: Without dead ends: 1619 [2022-03-15 20:23:18,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:23:18,562 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 67 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:18,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 168 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 345 Invalid, 0 Unknown, 70 Unchecked, 1.0s Time] [2022-03-15 20:23:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2022-03-15 20:23:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1394. [2022-03-15 20:23:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1367 states have (on average 1.9765910753474762) internal successors, (2702), 1393 states have internal predecessors, (2702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2702 transitions. [2022-03-15 20:23:18,578 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2702 transitions. Word has length 23 [2022-03-15 20:23:18,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:18,578 INFO L470 AbstractCegarLoop]: Abstraction has 1394 states and 2702 transitions. [2022-03-15 20:23:18,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2702 transitions. [2022-03-15 20:23:18,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:23:18,579 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:18,579 INFO L514 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:18,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 20:23:18,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 20:23:18,797 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:18,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:18,797 INFO L85 PathProgramCache]: Analyzing trace with hash -826506005, now seen corresponding path program 13 times [2022-03-15 20:23:18,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:18,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642173191] [2022-03-15 20:23:18,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:18,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:19,020 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:19,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:19,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642173191] [2022-03-15 20:23:19,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642173191] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:23:19,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019284234] [2022-03-15 20:23:19,020 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:23:19,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:19,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:23:19,021 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:23:19,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 20:23:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:20,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 1358 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:23:20,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:23:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:20,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:23:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:23:20,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019284234] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:23:20,169 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:23:20,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 12 [2022-03-15 20:23:20,169 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [586685257] [2022-03-15 20:23:20,169 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:20,172 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:20,179 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 51 transitions. [2022-03-15 20:23:20,179 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:20,181 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:20,181 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:20,183 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:20,183 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:20,248 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:20,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:23:20,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:20,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:23:20,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:23:20,249 INFO L87 Difference]: Start difference. First operand 1394 states and 2702 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:21,095 INFO L93 Difference]: Finished difference Result 1395 states and 2703 transitions. [2022-03-15 20:23:21,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:23:21,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-03-15 20:23:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:21,098 INFO L225 Difference]: With dead ends: 1395 [2022-03-15 20:23:21,098 INFO L226 Difference]: Without dead ends: 1395 [2022-03-15 20:23:21,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:23:21,098 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:21,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:23:21,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2022-03-15 20:23:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1395. [2022-03-15 20:23:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1368 states have (on average 1.9758771929824561) internal successors, (2703), 1394 states have internal predecessors, (2703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 2703 transitions. [2022-03-15 20:23:21,116 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 2703 transitions. Word has length 23 [2022-03-15 20:23:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:21,116 INFO L470 AbstractCegarLoop]: Abstraction has 1395 states and 2703 transitions. [2022-03-15 20:23:21,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 2703 transitions. [2022-03-15 20:23:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 20:23:21,118 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:21,118 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:21,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 20:23:21,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:23:21,332 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1334706800, now seen corresponding path program 14 times [2022-03-15 20:23:21,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:21,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134285239] [2022-03-15 20:23:21,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:21,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:23:21,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:21,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134285239] [2022-03-15 20:23:21,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134285239] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:21,982 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:23:21,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:23:21,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [327120180] [2022-03-15 20:23:21,982 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:21,984 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:21,991 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 52 transitions. [2022-03-15 20:23:21,991 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:21,997 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:21,998 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:22,009 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:22,010 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:22,120 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:22,121 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:22,124 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:22,125 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:22,253 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:22,253 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:22,255 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:22,255 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:22,335 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [83824#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|))] [2022-03-15 20:23:22,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:23:22,335 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:22,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:23:22,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:23:22,336 INFO L87 Difference]: Start difference. First operand 1395 states and 2703 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:23,747 INFO L93 Difference]: Finished difference Result 1636 states and 3114 transitions. [2022-03-15 20:23:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:23:23,747 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 24 [2022-03-15 20:23:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:23,749 INFO L225 Difference]: With dead ends: 1636 [2022-03-15 20:23:23,750 INFO L226 Difference]: Without dead ends: 1636 [2022-03-15 20:23:23,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:23:23,750 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 339 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:23,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 94 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:23:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2022-03-15 20:23:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1214. [2022-03-15 20:23:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1191 states have (on average 1.9638958858102435) internal successors, (2339), 1213 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2339 transitions. [2022-03-15 20:23:23,764 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2339 transitions. Word has length 24 [2022-03-15 20:23:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:23,765 INFO L470 AbstractCegarLoop]: Abstraction has 1214 states and 2339 transitions. [2022-03-15 20:23:23,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2339 transitions. [2022-03-15 20:23:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 20:23:23,765 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:23,765 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:23,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-15 20:23:23,765 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:23,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:23,766 INFO L85 PathProgramCache]: Analyzing trace with hash 88966435, now seen corresponding path program 1 times [2022-03-15 20:23:23,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:23,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810491833] [2022-03-15 20:23:23,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:23,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:23:24,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:24,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810491833] [2022-03-15 20:23:24,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810491833] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:24,076 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:23:24,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:23:24,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2093709851] [2022-03-15 20:23:24,076 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:24,078 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:24,083 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 28 transitions. [2022-03-15 20:23:24,083 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:24,094 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:24,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:23:24,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:24,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:23:24,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:23:24,095 INFO L87 Difference]: Start difference. First operand 1214 states and 2339 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:26,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:26,958 INFO L93 Difference]: Finished difference Result 1247 states and 2365 transitions. [2022-03-15 20:23:26,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:23:26,958 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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 24 [2022-03-15 20:23:26,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:26,960 INFO L225 Difference]: With dead ends: 1247 [2022-03-15 20:23:26,960 INFO L226 Difference]: Without dead ends: 1247 [2022-03-15 20:23:26,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:23:26,961 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 269 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:26,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 138 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 20:23:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2022-03-15 20:23:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1184. [2022-03-15 20:23:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1161 states have (on average 1.962962962962963) internal successors, (2279), 1183 states have internal predecessors, (2279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 2279 transitions. [2022-03-15 20:23:26,982 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 2279 transitions. Word has length 24 [2022-03-15 20:23:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:26,983 INFO L470 AbstractCegarLoop]: Abstraction has 1184 states and 2279 transitions. [2022-03-15 20:23:26,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 2279 transitions. [2022-03-15 20:23:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:23:26,986 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:26,986 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:26,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-15 20:23:26,986 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:26,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:26,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1347088915, now seen corresponding path program 1 times [2022-03-15 20:23:26,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:26,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194138816] [2022-03-15 20:23:26,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:26,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:23:27,161 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:27,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194138816] [2022-03-15 20:23:27,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194138816] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:27,161 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:23:27,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:23:27,161 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [93439281] [2022-03-15 20:23:27,161 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:27,164 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:27,168 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2022-03-15 20:23:27,168 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:27,168 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:27,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:23:27,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:27,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:23:27,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:23:27,169 INFO L87 Difference]: Start difference. First operand 1184 states and 2279 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:30,091 INFO L93 Difference]: Finished difference Result 1382 states and 2670 transitions. [2022-03-15 20:23:30,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:23:30,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 20:23:30,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:30,108 INFO L225 Difference]: With dead ends: 1382 [2022-03-15 20:23:30,109 INFO L226 Difference]: Without dead ends: 1382 [2022-03-15 20:23:30,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:23:30,110 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 77 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:30,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 58 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-03-15 20:23:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-03-15 20:23:30,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1339. [2022-03-15 20:23:30,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1316 states have (on average 1.9642857142857142) internal successors, (2585), 1338 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2585 transitions. [2022-03-15 20:23:30,131 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2585 transitions. Word has length 26 [2022-03-15 20:23:30,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:30,131 INFO L470 AbstractCegarLoop]: Abstraction has 1339 states and 2585 transitions. [2022-03-15 20:23:30,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2585 transitions. [2022-03-15 20:23:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 20:23:30,132 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:30,132 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:30,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-15 20:23:30,132 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:30,132 INFO L85 PathProgramCache]: Analyzing trace with hash -492351558, now seen corresponding path program 1 times [2022-03-15 20:23:30,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:30,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338954759] [2022-03-15 20:23:30,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:30,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:30,316 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:23:30,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:30,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338954759] [2022-03-15 20:23:30,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338954759] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:30,317 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:23:30,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:23:30,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1081308676] [2022-03-15 20:23:30,317 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:30,322 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:30,328 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 27 transitions. [2022-03-15 20:23:30,328 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:30,328 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:30,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:23:30,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:30,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:23:30,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:23:30,329 INFO L87 Difference]: Start difference. First operand 1339 states and 2585 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:33,104 INFO L93 Difference]: Finished difference Result 1419 states and 2741 transitions. [2022-03-15 20:23:33,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:23:33,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 20:23:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:33,107 INFO L225 Difference]: With dead ends: 1419 [2022-03-15 20:23:33,107 INFO L226 Difference]: Without dead ends: 1419 [2022-03-15 20:23:33,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:23:33,109 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 44 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:33,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 67 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 20:23:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2022-03-15 20:23:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1419. [2022-03-15 20:23:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1396 states have (on average 1.9634670487106016) internal successors, (2741), 1418 states have internal predecessors, (2741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2741 transitions. [2022-03-15 20:23:33,124 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2741 transitions. Word has length 27 [2022-03-15 20:23:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:33,124 INFO L470 AbstractCegarLoop]: Abstraction has 1419 states and 2741 transitions. [2022-03-15 20:23:33,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2741 transitions. [2022-03-15 20:23:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:23:33,124 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:33,125 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:33,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-15 20:23:33,125 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:33,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1491505091, now seen corresponding path program 1 times [2022-03-15 20:23:33,126 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:33,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528641459] [2022-03-15 20:23:33,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:23:33,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:33,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528641459] [2022-03-15 20:23:33,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528641459] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:33,680 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:23:33,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 20:23:33,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [698425536] [2022-03-15 20:23:33,680 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:33,684 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:33,697 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 82 transitions. [2022-03-15 20:23:33,697 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:33,986 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:33,987 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:33,990 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:33,990 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:34,029 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:34,029 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:34,032 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:34,033 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:34,127 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:34,129 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:34,132 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:23:34,133 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:23:35,172 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 12 treesize of output 4 [2022-03-15 20:23:35,175 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 12 treesize of output 4 [2022-03-15 20:23:35,178 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 12 treesize of output 4 [2022-03-15 20:23:35,183 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 12 treesize of output 4 [2022-03-15 20:23:35,333 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [99890#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 99883#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|))) (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6))))), 99892#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 7 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 6 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))), 99887#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 99893#(or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 99882#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|))) (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6))))), 99884#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|))) (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6))))), 99895#(= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))), 99894#(or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 99889#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 99888#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 99891#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 99886#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 99885#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|))) (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)))))] [2022-03-15 20:23:35,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:23:35,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:35,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:23:35,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:23:35,334 INFO L87 Difference]: Start difference. First operand 1419 states and 2741 transitions. Second operand has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:38,552 INFO L93 Difference]: Finished difference Result 2299 states and 4464 transitions. [2022-03-15 20:23:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:23:38,553 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 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 30 [2022-03-15 20:23:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:38,556 INFO L225 Difference]: With dead ends: 2299 [2022-03-15 20:23:38,557 INFO L226 Difference]: Without dead ends: 2299 [2022-03-15 20:23:38,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=544, Invalid=1348, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:23:38,557 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 586 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:38,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [586 Valid, 120 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-15 20:23:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2022-03-15 20:23:38,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 1434. [2022-03-15 20:23:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1411 states have (on average 1.963855421686747) internal successors, (2771), 1433 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2771 transitions. [2022-03-15 20:23:38,575 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2771 transitions. Word has length 30 [2022-03-15 20:23:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:38,575 INFO L470 AbstractCegarLoop]: Abstraction has 1434 states and 2771 transitions. [2022-03-15 20:23:38,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2771 transitions. [2022-03-15 20:23:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:23:38,576 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:38,576 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:38,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 20:23:38,576 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:38,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:38,576 INFO L85 PathProgramCache]: Analyzing trace with hash -949372922, now seen corresponding path program 1 times [2022-03-15 20:23:38,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:38,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717705909] [2022-03-15 20:23:38,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:38,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:23:38,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:38,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717705909] [2022-03-15 20:23:38,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717705909] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:38,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:23:38,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 20:23:38,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [426922122] [2022-03-15 20:23:38,981 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:38,985 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:38,996 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 58 transitions. [2022-03-15 20:23:38,996 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:39,306 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [105119#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 105116#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 105113#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 105118#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 105112#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 105114#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 105117#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 105115#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 105120#(not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|))] [2022-03-15 20:23:39,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:23:39,306 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:39,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:23:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:23:39,307 INFO L87 Difference]: Start difference. First operand 1434 states and 2771 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:42,930 INFO L93 Difference]: Finished difference Result 2339 states and 4544 transitions. [2022-03-15 20:23:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:23:42,931 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 20:23:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:42,933 INFO L225 Difference]: With dead ends: 2339 [2022-03-15 20:23:42,933 INFO L226 Difference]: Without dead ends: 2339 [2022-03-15 20:23:42,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=876, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:23:42,934 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 465 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:42,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [465 Valid, 148 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-03-15 20:23:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2022-03-15 20:23:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 1467. [2022-03-15 20:23:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1444 states have (on average 1.9646814404432134) internal successors, (2837), 1466 states have internal predecessors, (2837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2837 transitions. [2022-03-15 20:23:42,977 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2837 transitions. Word has length 30 [2022-03-15 20:23:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:42,977 INFO L470 AbstractCegarLoop]: Abstraction has 1467 states and 2837 transitions. [2022-03-15 20:23:42,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2837 transitions. [2022-03-15 20:23:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:23:42,978 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:42,978 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:42,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 20:23:42,978 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:42,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:42,978 INFO L85 PathProgramCache]: Analyzing trace with hash -471636250, now seen corresponding path program 2 times [2022-03-15 20:23:42,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:42,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706444651] [2022-03-15 20:23:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:42,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:23:43,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:43,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706444651] [2022-03-15 20:23:43,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706444651] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:43,512 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:23:43,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:23:43,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2145310738] [2022-03-15 20:23:43,512 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:43,516 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:43,529 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 52 transitions. [2022-03-15 20:23:43,529 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:43,772 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [110434#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (or (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 3 |~#slot~0.base|)), 110435#(and (= (select |#valid| |~#slot~0.base|) 1) (= 3 |~#slot~0.base|) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1) (not (= (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 0))))] [2022-03-15 20:23:43,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:23:43,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:43,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:23:43,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:23:43,773 INFO L87 Difference]: Start difference. First operand 1467 states and 2837 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:45,978 INFO L93 Difference]: Finished difference Result 1839 states and 3534 transitions. [2022-03-15 20:23:45,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:23:45,978 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 20:23:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:45,980 INFO L225 Difference]: With dead ends: 1839 [2022-03-15 20:23:45,980 INFO L226 Difference]: Without dead ends: 1839 [2022-03-15 20:23:45,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=629, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:23:45,981 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 406 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:45,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 188 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:23:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2022-03-15 20:23:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1466. [2022-03-15 20:23:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1443 states have (on average 1.9646569646569647) internal successors, (2835), 1465 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2835 transitions. [2022-03-15 20:23:45,995 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2835 transitions. Word has length 30 [2022-03-15 20:23:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:45,996 INFO L470 AbstractCegarLoop]: Abstraction has 1466 states and 2835 transitions. [2022-03-15 20:23:45,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2835 transitions. [2022-03-15 20:23:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:23:45,996 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:45,996 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:45,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-15 20:23:45,996 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:45,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:45,997 INFO L85 PathProgramCache]: Analyzing trace with hash -433742470, now seen corresponding path program 3 times [2022-03-15 20:23:45,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:45,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939471515] [2022-03-15 20:23:45,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:45,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:23:46,540 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:46,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939471515] [2022-03-15 20:23:46,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939471515] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:46,541 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:23:46,541 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:23:46,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [123356206] [2022-03-15 20:23:46,541 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:46,545 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:46,555 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 58 transitions. [2022-03-15 20:23:46,555 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:46,795 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [115252#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|))] [2022-03-15 20:23:46,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:23:46,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:46,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:23:46,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:23:46,796 INFO L87 Difference]: Start difference. First operand 1466 states and 2835 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:50,843 INFO L93 Difference]: Finished difference Result 1878 states and 3612 transitions. [2022-03-15 20:23:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 20:23:50,843 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-03-15 20:23:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:50,846 INFO L225 Difference]: With dead ends: 1878 [2022-03-15 20:23:50,846 INFO L226 Difference]: Without dead ends: 1878 [2022-03-15 20:23:50,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:23:50,846 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 300 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:50,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 181 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 20:23:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-03-15 20:23:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1505. [2022-03-15 20:23:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1482 states have (on average 1.9676113360323886) internal successors, (2916), 1504 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2916 transitions. [2022-03-15 20:23:50,862 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2916 transitions. Word has length 30 [2022-03-15 20:23:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:50,862 INFO L470 AbstractCegarLoop]: Abstraction has 1505 states and 2916 transitions. [2022-03-15 20:23:50,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2916 transitions. [2022-03-15 20:23:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:23:50,862 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:50,862 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:50,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-15 20:23:50,863 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:50,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:50,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1614454382, now seen corresponding path program 1 times [2022-03-15 20:23:50,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:50,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305057386] [2022-03-15 20:23:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:50,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:23:51,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:51,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305057386] [2022-03-15 20:23:51,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305057386] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:51,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:23:51,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:23:51,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2013374573] [2022-03-15 20:23:51,230 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:51,234 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:51,242 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 34 transitions. [2022-03-15 20:23:51,242 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:51,264 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:51,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:23:51,265 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:51,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:23:51,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:23:51,265 INFO L87 Difference]: Start difference. First operand 1505 states and 2916 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:52,983 INFO L93 Difference]: Finished difference Result 1537 states and 2941 transitions. [2022-03-15 20:23:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:23:52,983 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 20:23:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:52,985 INFO L225 Difference]: With dead ends: 1537 [2022-03-15 20:23:52,985 INFO L226 Difference]: Without dead ends: 1537 [2022-03-15 20:23:52,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:23:52,986 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 267 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:52,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 117 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 20:23:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-03-15 20:23:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1475. [2022-03-15 20:23:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1452 states have (on average 1.9669421487603307) internal successors, (2856), 1474 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2856 transitions. [2022-03-15 20:23:52,999 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2856 transitions. Word has length 30 [2022-03-15 20:23:52,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:52,999 INFO L470 AbstractCegarLoop]: Abstraction has 1475 states and 2856 transitions. [2022-03-15 20:23:52,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2856 transitions. [2022-03-15 20:23:53,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:23:53,000 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:53,000 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:53,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-15 20:23:53,000 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:53,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:53,004 INFO L85 PathProgramCache]: Analyzing trace with hash -62729689, now seen corresponding path program 2 times [2022-03-15 20:23:53,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:53,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069911392] [2022-03-15 20:23:53,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:53,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:23:53,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:53,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069911392] [2022-03-15 20:23:53,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069911392] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:53,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:23:53,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:23:53,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [385577038] [2022-03-15 20:23:53,407 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:53,411 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:53,418 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 30 transitions. [2022-03-15 20:23:53,418 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:53,418 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:23:53,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:23:53,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:53,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:23:53,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:23:53,419 INFO L87 Difference]: Start difference. First operand 1475 states and 2856 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:23:56,706 INFO L93 Difference]: Finished difference Result 2325 states and 4506 transitions. [2022-03-15 20:23:56,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:23:56,707 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 20:23:56,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:23:56,709 INFO L225 Difference]: With dead ends: 2325 [2022-03-15 20:23:56,709 INFO L226 Difference]: Without dead ends: 2325 [2022-03-15 20:23:56,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:23:56,710 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 409 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:23:56,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 176 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 20:23:56,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2022-03-15 20:23:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 1607. [2022-03-15 20:23:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1585 states have (on average 1.9678233438485804) internal successors, (3119), 1606 states have internal predecessors, (3119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3119 transitions. [2022-03-15 20:23:56,727 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3119 transitions. Word has length 30 [2022-03-15 20:23:56,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:23:56,727 INFO L470 AbstractCegarLoop]: Abstraction has 1607 states and 3119 transitions. [2022-03-15 20:23:56,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:23:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3119 transitions. [2022-03-15 20:23:56,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:23:56,728 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:23:56,728 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:23:56,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-15 20:23:56,728 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:23:56,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:23:56,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1035277446, now seen corresponding path program 4 times [2022-03-15 20:23:56,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:23:56,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864070603] [2022-03-15 20:23:56,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:23:56,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:23:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:23:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:23:57,500 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:23:57,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864070603] [2022-03-15 20:23:57,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864070603] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:23:57,501 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:23:57,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:23:57,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [31452120] [2022-03-15 20:23:57,501 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:23:57,504 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:23:57,513 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 38 transitions. [2022-03-15 20:23:57,513 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:23:57,610 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [130265#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= 3 |~#slot~0.base|) (not (<= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1) |t_funThread1of1ForFork0_new_~p~0#1.offset|)))] [2022-03-15 20:23:57,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:23:57,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:23:57,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:23:57,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:23:57,611 INFO L87 Difference]: Start difference. First operand 1607 states and 3119 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:00,251 INFO L93 Difference]: Finished difference Result 2213 states and 4284 transitions. [2022-03-15 20:24:00,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:24:00,251 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 20:24:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:00,254 INFO L225 Difference]: With dead ends: 2213 [2022-03-15 20:24:00,254 INFO L226 Difference]: Without dead ends: 2213 [2022-03-15 20:24:00,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:24:00,254 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 243 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:00,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 175 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 20:24:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2022-03-15 20:24:00,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 1592. [2022-03-15 20:24:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1570 states have (on average 1.9675159235668789) internal successors, (3089), 1591 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 3089 transitions. [2022-03-15 20:24:00,271 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 3089 transitions. Word has length 30 [2022-03-15 20:24:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:00,271 INFO L470 AbstractCegarLoop]: Abstraction has 1592 states and 3089 transitions. [2022-03-15 20:24:00,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:00,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 3089 transitions. [2022-03-15 20:24:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 20:24:00,273 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:00,273 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:00,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-15 20:24:00,273 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:00,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:00,273 INFO L85 PathProgramCache]: Analyzing trace with hash 318659518, now seen corresponding path program 5 times [2022-03-15 20:24:00,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:00,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365707297] [2022-03-15 20:24:00,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:00,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:00,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:00,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365707297] [2022-03-15 20:24:00,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365707297] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:00,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:00,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:24:00,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1833874297] [2022-03-15 20:24:00,716 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:00,720 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:00,728 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 38 transitions. [2022-03-15 20:24:00,728 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:00,904 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [135696#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= 3 |~#slot~0.base|)), 135694#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 1)) |t_funThread1of1ForFork0_new_#t~nondet31#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= 3 |~#slot~0.base|) (= |t_funThread1of1ForFork0_new_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |t_funThread1of1ForFork0_new_~p~0#1.offset|))), 135693#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 1)) |t_funThread1of1ForFork0_new_#t~nondet31#1|) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 2)) |t_funThread1of1ForFork0_new_#t~nondet31#1|) (= 3 |~#slot~0.base|) (= |t_funThread1of1ForFork0_new_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 3)) |t_funThread1of1ForFork0_new_#t~nondet31#1|)), 135695#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= 3 |~#slot~0.base|) (= |t_funThread1of1ForFork0_new_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |t_funThread1of1ForFork0_new_~p~0#1.offset|)))] [2022-03-15 20:24:00,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:24:00,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:00,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:24:00,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:24:00,906 INFO L87 Difference]: Start difference. First operand 1592 states and 3089 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:03,610 INFO L93 Difference]: Finished difference Result 2154 states and 4166 transitions. [2022-03-15 20:24:03,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:24:03,611 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 30 [2022-03-15 20:24:03,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:03,613 INFO L225 Difference]: With dead ends: 2154 [2022-03-15 20:24:03,613 INFO L226 Difference]: Without dead ends: 2154 [2022-03-15 20:24:03,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=516, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:24:03,613 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 265 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:03,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 175 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 20:24:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-03-15 20:24:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1520. [2022-03-15 20:24:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1498 states have (on average 1.965954606141522) internal successors, (2945), 1519 states have internal predecessors, (2945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2945 transitions. [2022-03-15 20:24:03,628 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2945 transitions. Word has length 30 [2022-03-15 20:24:03,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:03,628 INFO L470 AbstractCegarLoop]: Abstraction has 1520 states and 2945 transitions. [2022-03-15 20:24:03,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:03,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2945 transitions. [2022-03-15 20:24:03,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 20:24:03,629 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:03,629 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:03,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-15 20:24:03,629 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:03,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:03,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1007984902, now seen corresponding path program 1 times [2022-03-15 20:24:03,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:03,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741949773] [2022-03-15 20:24:03,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:03,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:04,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:04,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741949773] [2022-03-15 20:24:04,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741949773] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:04,105 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:04,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:24:04,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1108741207] [2022-03-15 20:24:04,105 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:04,109 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:04,122 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 83 transitions. [2022-03-15 20:24:04,122 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:04,244 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:04,245 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:04,247 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:04,248 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:04,267 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:04,268 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:04,270 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:04,270 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:04,287 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:04,288 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:04,289 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:04,290 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:04,817 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [140931#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 140927#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 140933#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 140932#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 140934#(or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 140935#(or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 140923#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)), 140930#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 140929#(and (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 140925#(and (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 140926#(and (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 140924#(and (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)), 140928#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:24:04,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:24:04,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:04,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:24:04,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:24:04,818 INFO L87 Difference]: Start difference. First operand 1520 states and 2945 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:08,071 INFO L93 Difference]: Finished difference Result 2648 states and 5162 transitions. [2022-03-15 20:24:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:24:08,072 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 20:24:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:08,075 INFO L225 Difference]: With dead ends: 2648 [2022-03-15 20:24:08,075 INFO L226 Difference]: Without dead ends: 2648 [2022-03-15 20:24:08,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=1144, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 20:24:08,076 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 566 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:08,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 147 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 20:24:08,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2022-03-15 20:24:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1483. [2022-03-15 20:24:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1461 states have (on average 1.9637234770704997) internal successors, (2869), 1482 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 2869 transitions. [2022-03-15 20:24:08,092 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 2869 transitions. Word has length 31 [2022-03-15 20:24:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:08,092 INFO L470 AbstractCegarLoop]: Abstraction has 1483 states and 2869 transitions. [2022-03-15 20:24:08,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2869 transitions. [2022-03-15 20:24:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 20:24:08,093 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:08,093 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:08,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-15 20:24:08,093 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:08,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:08,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221223, now seen corresponding path program 1 times [2022-03-15 20:24:08,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:08,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238012346] [2022-03-15 20:24:08,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:08,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:08,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:08,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238012346] [2022-03-15 20:24:08,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238012346] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:08,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:08,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:24:08,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1602346516] [2022-03-15 20:24:08,258 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:08,262 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:08,268 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 32 transitions. [2022-03-15 20:24:08,268 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:08,268 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:08,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:24:08,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:08,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:24:08,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:08,269 INFO L87 Difference]: Start difference. First operand 1483 states and 2869 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:10,135 INFO L93 Difference]: Finished difference Result 1769 states and 3388 transitions. [2022-03-15 20:24:10,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:24:10,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 20:24:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:10,138 INFO L225 Difference]: With dead ends: 1769 [2022-03-15 20:24:10,138 INFO L226 Difference]: Without dead ends: 1731 [2022-03-15 20:24:10,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:10,138 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 79 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:10,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 62 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:24:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2022-03-15 20:24:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1599. [2022-03-15 20:24:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1577 states have (on average 1.9613189600507293) internal successors, (3093), 1598 states have internal predecessors, (3093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 3093 transitions. [2022-03-15 20:24:10,179 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 3093 transitions. Word has length 32 [2022-03-15 20:24:10,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:10,180 INFO L470 AbstractCegarLoop]: Abstraction has 1599 states and 3093 transitions. [2022-03-15 20:24:10,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 3093 transitions. [2022-03-15 20:24:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 20:24:10,180 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:10,180 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:24:10,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-15 20:24:10,181 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:10,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:10,181 INFO L85 PathProgramCache]: Analyzing trace with hash 602126818, now seen corresponding path program 1 times [2022-03-15 20:24:10,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:10,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960176975] [2022-03-15 20:24:10,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:10,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:10,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:10,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960176975] [2022-03-15 20:24:10,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960176975] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:10,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:10,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:24:10,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1042992228] [2022-03-15 20:24:10,356 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:10,360 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:10,367 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 32 transitions. [2022-03-15 20:24:10,367 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:10,368 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:24:10,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:24:10,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:10,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:24:10,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:10,368 INFO L87 Difference]: Start difference. First operand 1599 states and 3093 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:11,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:11,501 INFO L93 Difference]: Finished difference Result 1567 states and 3030 transitions. [2022-03-15 20:24:11,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:24:11,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 20:24:11,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:11,503 INFO L225 Difference]: With dead ends: 1567 [2022-03-15 20:24:11,504 INFO L226 Difference]: Without dead ends: 1567 [2022-03-15 20:24:11,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:24:11,505 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 56 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:11,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 57 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:24:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-03-15 20:24:11,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2022-03-15 20:24:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1548 states have (on average 1.9573643410852712) internal successors, (3030), 1566 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 3030 transitions. [2022-03-15 20:24:11,519 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 3030 transitions. Word has length 32 [2022-03-15 20:24:11,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:11,519 INFO L470 AbstractCegarLoop]: Abstraction has 1567 states and 3030 transitions. [2022-03-15 20:24:11,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 3030 transitions. [2022-03-15 20:24:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 20:24:11,520 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:11,520 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:24:11,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-15 20:24:11,520 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:11,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:11,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1258374629, now seen corresponding path program 1 times [2022-03-15 20:24:11,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:11,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809746599] [2022-03-15 20:24:11,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:11,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:11,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:11,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809746599] [2022-03-15 20:24:11,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809746599] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:11,931 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:11,931 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:24:11,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [159353299] [2022-03-15 20:24:11,931 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:11,935 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:11,999 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 65 transitions. [2022-03-15 20:24:11,999 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:12,242 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [156278#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= 1 |~#slot~0.offset|)) (= 3 |~#slot~0.base|))] [2022-03-15 20:24:12,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:24:12,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:12,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:24:12,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:24:12,243 INFO L87 Difference]: Start difference. First operand 1567 states and 3030 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:14,996 INFO L93 Difference]: Finished difference Result 1886 states and 3618 transitions. [2022-03-15 20:24:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:24:14,997 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-03-15 20:24:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:14,999 INFO L225 Difference]: With dead ends: 1886 [2022-03-15 20:24:14,999 INFO L226 Difference]: Without dead ends: 1886 [2022-03-15 20:24:14,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:24:14,999 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 351 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:15,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 169 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 20:24:15,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2022-03-15 20:24:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1538. [2022-03-15 20:24:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1519 states have (on average 1.956550362080316) internal successors, (2972), 1537 states have internal predecessors, (2972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2972 transitions. [2022-03-15 20:24:15,014 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2972 transitions. Word has length 35 [2022-03-15 20:24:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:15,014 INFO L470 AbstractCegarLoop]: Abstraction has 1538 states and 2972 transitions. [2022-03-15 20:24:15,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2972 transitions. [2022-03-15 20:24:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:24:15,015 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:15,015 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:24:15,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-15 20:24:15,015 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:15,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:15,015 INFO L85 PathProgramCache]: Analyzing trace with hash 947328055, now seen corresponding path program 1 times [2022-03-15 20:24:15,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:15,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999240068] [2022-03-15 20:24:15,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:15,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:15,547 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:15,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999240068] [2022-03-15 20:24:15,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999240068] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:15,547 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:15,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:24:15,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1852915678] [2022-03-15 20:24:15,547 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:15,552 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:15,577 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 112 transitions. [2022-03-15 20:24:15,577 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:15,752 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:15,753 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:15,755 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:15,756 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:15,780 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:15,781 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:15,783 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:15,783 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:15,804 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:15,804 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:15,807 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:15,812 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:17,700 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [161295#(and (or (= |ULTIMATE.start_main_#t~mem50#1.offset| 0) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 |ULTIMATE.start_main_#t~mem50#1.offset|))) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)))), 161298#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))))), 161302#(and (or (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))))))), 161308#(and (= |ULTIMATE.start_main_#t~mem50#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0))), 161314#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0))), 161313#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 161304#(and (or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (= |ULTIMATE.start_main_#t~mem50#1.offset| 0) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)))), 161297#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (= |ULTIMATE.start_main_#t~mem50#1.offset| 0) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 |ULTIMATE.start_main_#t~mem50#1.offset|)))), 161312#(and (or (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 161303#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) 0) (not (= (+ 3 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 161301#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 161296#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 |ULTIMATE.start_main_#t~mem50#1.offset|))) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))) (or (= |ULTIMATE.start_main_#t~mem50#1.offset| 0) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)))), 161311#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 161289#(and (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) (+ 2 |ULTIMATE.start_main_~p~1#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) |ULTIMATE.start_main_~p~1#1.offset|) 0) (= |ULTIMATE.start_main_~p~1#1.offset| 0) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 |ULTIMATE.start_main_~p~1#1.offset|))) (not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) (+ |ULTIMATE.start_main_~p~1#1.offset| 1)) 0)), 161293#(and (or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (= |ULTIMATE.start_main_#t~mem50#1.offset| 0) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 |ULTIMATE.start_main_#t~mem50#1.offset|))) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)))), 161309#(and (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)), 161292#(and (= |ULTIMATE.start_main_~p~1#1.offset| 0) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 |ULTIMATE.start_main_~p~1#1.offset|))) (not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_new_~p~0#1.base|))), 161305#(and (or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (= |ULTIMATE.start_main_#t~mem50#1.offset| 0) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)))), 161291#(and (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) |ULTIMATE.start_main_~p~1#1.offset|) 0) (= |ULTIMATE.start_main_~p~1#1.offset| 0) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 |ULTIMATE.start_main_~p~1#1.offset|))) (not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_new_~p~0#1.base|))), 161307#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))) (or (= |ULTIMATE.start_main_#t~mem50#1.offset| 0) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)))), 161294#(and (or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (= |ULTIMATE.start_main_#t~mem50#1.offset| 0) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 |ULTIMATE.start_main_#t~mem50#1.offset|))) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)))), 161306#(and (or (= |ULTIMATE.start_main_#t~mem50#1.offset| 0) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)))), 161290#(and (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) |ULTIMATE.start_main_~p~1#1.offset|) 0) (= |ULTIMATE.start_main_~p~1#1.offset| 0) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 |ULTIMATE.start_main_~p~1#1.offset|))) (not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) (+ |ULTIMATE.start_main_~p~1#1.offset| 1)) 0)), 161299#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 161310#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 161300#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:24:17,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 20:24:17,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:17,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 20:24:17,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1404, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 20:24:17,701 INFO L87 Difference]: Start difference. First operand 1538 states and 2972 transitions. Second operand has 40 states, 39 states have (on average 2.3333333333333335) internal successors, (91), 39 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:30,801 INFO L93 Difference]: Finished difference Result 2620 states and 4996 transitions. [2022-03-15 20:24:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 20:24:30,801 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.3333333333333335) internal successors, (91), 39 states have internal predecessors, (91), 0 states have call successors, (0), 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 36 [2022-03-15 20:24:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:30,805 INFO L225 Difference]: With dead ends: 2620 [2022-03-15 20:24:30,805 INFO L226 Difference]: Without dead ends: 2620 [2022-03-15 20:24:30,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=605, Invalid=3951, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 20:24:30,806 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 718 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 6676 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 6942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 6676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:30,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [718 Valid, 444 Invalid, 6942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 6676 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2022-03-15 20:24:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2022-03-15 20:24:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 1769. [2022-03-15 20:24:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1750 states have (on average 1.968) internal successors, (3444), 1768 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 3444 transitions. [2022-03-15 20:24:30,827 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 3444 transitions. Word has length 36 [2022-03-15 20:24:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:30,827 INFO L470 AbstractCegarLoop]: Abstraction has 1769 states and 3444 transitions. [2022-03-15 20:24:30,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.3333333333333335) internal successors, (91), 39 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 3444 transitions. [2022-03-15 20:24:30,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:24:30,828 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:30,828 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:24:30,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-15 20:24:30,828 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:30,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:30,828 INFO L85 PathProgramCache]: Analyzing trace with hash 804420709, now seen corresponding path program 1 times [2022-03-15 20:24:30,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:30,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399516757] [2022-03-15 20:24:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:31,321 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:31,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399516757] [2022-03-15 20:24:31,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399516757] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:31,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:31,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:24:31,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1351498179] [2022-03-15 20:24:31,322 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:31,326 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:31,343 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 88 transitions. [2022-03-15 20:24:31,343 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:32,075 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [167562#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 167550#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 167546#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 167552#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 167549#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)), 167556#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 167555#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 167548#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)), 167545#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 167554#(not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)), 167542#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 167553#(not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)), 167547#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 167559#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 167558#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))), 167544#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 167561#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 167563#(not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0)), 167551#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 167543#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 167560#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 167557#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))] [2022-03-15 20:24:32,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 20:24:32,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:32,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 20:24:32,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:24:32,078 INFO L87 Difference]: Start difference. First operand 1769 states and 3444 transitions. Second operand has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:35,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 20:24:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:39,892 INFO L93 Difference]: Finished difference Result 2641 states and 5050 transitions. [2022-03-15 20:24:39,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 20:24:39,893 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 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 36 [2022-03-15 20:24:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:39,896 INFO L225 Difference]: With dead ends: 2641 [2022-03-15 20:24:39,896 INFO L226 Difference]: Without dead ends: 2641 [2022-03-15 20:24:39,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=704, Invalid=4126, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 20:24:39,897 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 720 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 3701 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 3831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 3701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:39,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [720 Valid, 357 Invalid, 3831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 3701 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-03-15 20:24:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2022-03-15 20:24:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 1785. [2022-03-15 20:24:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1766 states have (on average 1.968289920724802) internal successors, (3476), 1784 states have internal predecessors, (3476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 3476 transitions. [2022-03-15 20:24:39,951 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 3476 transitions. Word has length 36 [2022-03-15 20:24:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:39,951 INFO L470 AbstractCegarLoop]: Abstraction has 1785 states and 3476 transitions. [2022-03-15 20:24:39,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 3476 transitions. [2022-03-15 20:24:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:24:39,952 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:39,952 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:24:39,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-15 20:24:39,958 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:39,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:39,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2060557268, now seen corresponding path program 1 times [2022-03-15 20:24:39,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:39,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710184480] [2022-03-15 20:24:39,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:39,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:40,381 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:40,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710184480] [2022-03-15 20:24:40,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710184480] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:40,382 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:40,382 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:24:40,382 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [429003307] [2022-03-15 20:24:40,382 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:40,387 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:40,405 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 88 transitions. [2022-03-15 20:24:40,405 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:40,492 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:40,493 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:40,494 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:40,494 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:40,512 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:40,512 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:40,514 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:40,514 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:40,522 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:40,522 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:40,524 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:40,524 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:40,877 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [173858#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)), 173862#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 173864#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 173859#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)), 173868#(or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 173863#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 173865#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 173860#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)), 173866#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 173870#(= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1), 173861#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 173867#(or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 173869#(not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)), 173857#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0))] [2022-03-15 20:24:40,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:24:40,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:40,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:24:40,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:24:40,878 INFO L87 Difference]: Start difference. First operand 1785 states and 3476 transitions. Second operand has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:45,167 INFO L93 Difference]: Finished difference Result 2425 states and 4707 transitions. [2022-03-15 20:24:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:24:45,167 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 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 36 [2022-03-15 20:24:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:45,170 INFO L225 Difference]: With dead ends: 2425 [2022-03-15 20:24:45,170 INFO L226 Difference]: Without dead ends: 2425 [2022-03-15 20:24:45,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=501, Invalid=1479, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 20:24:45,171 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 552 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:45,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [552 Valid, 183 Invalid, 2734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-03-15 20:24:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2022-03-15 20:24:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 1484. [2022-03-15 20:24:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1467 states have (on average 1.9550102249488752) internal successors, (2868), 1483 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 2868 transitions. [2022-03-15 20:24:45,186 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 2868 transitions. Word has length 36 [2022-03-15 20:24:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:45,186 INFO L470 AbstractCegarLoop]: Abstraction has 1484 states and 2868 transitions. [2022-03-15 20:24:45,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 2868 transitions. [2022-03-15 20:24:45,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:24:45,186 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:45,187 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:24:45,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-15 20:24:45,187 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:45,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:45,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1042830267, now seen corresponding path program 2 times [2022-03-15 20:24:45,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:45,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039860756] [2022-03-15 20:24:45,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:45,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:45,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:45,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039860756] [2022-03-15 20:24:45,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039860756] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:45,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:45,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:24:45,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2063264451] [2022-03-15 20:24:45,686 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:45,690 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:45,706 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 82 transitions. [2022-03-15 20:24:45,706 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:46,727 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [179318#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 179325#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 179316#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 179317#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 179321#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 179320#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 179322#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 179323#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 179319#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 179326#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0))), 179324#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))))] [2022-03-15 20:24:46,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:24:46,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:46,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:24:46,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:24:46,728 INFO L87 Difference]: Start difference. First operand 1484 states and 2868 transitions. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:52,522 INFO L93 Difference]: Finished difference Result 2154 states and 4164 transitions. [2022-03-15 20:24:52,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 20:24:52,522 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 20:24:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:52,525 INFO L225 Difference]: With dead ends: 2154 [2022-03-15 20:24:52,525 INFO L226 Difference]: Without dead ends: 2154 [2022-03-15 20:24:52,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=671, Invalid=2635, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 20:24:52,527 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 523 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 2971 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:52,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 247 Invalid, 3096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2971 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-03-15 20:24:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-03-15 20:24:52,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1528. [2022-03-15 20:24:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1511 states have (on average 1.9536730641958968) internal successors, (2952), 1527 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2952 transitions. [2022-03-15 20:24:52,561 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2952 transitions. Word has length 36 [2022-03-15 20:24:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:52,561 INFO L470 AbstractCegarLoop]: Abstraction has 1528 states and 2952 transitions. [2022-03-15 20:24:52,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2952 transitions. [2022-03-15 20:24:52,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:24:52,562 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:52,562 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:24:52,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-15 20:24:52,563 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:52,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:52,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1384621771, now seen corresponding path program 1 times [2022-03-15 20:24:52,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:52,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439510667] [2022-03-15 20:24:52,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:52,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:52,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:52,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439510667] [2022-03-15 20:24:52,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439510667] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:52,956 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:52,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:24:52,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1714371014] [2022-03-15 20:24:52,956 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:52,960 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:52,974 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 64 transitions. [2022-03-15 20:24:52,974 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:53,323 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [184616#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 184618#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 184622#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 184617#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 184623#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 184621#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 184620#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 184624#(not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 0)), 184615#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 184619#(not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|))] [2022-03-15 20:24:53,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 20:24:53,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:53,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 20:24:53,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:24:53,324 INFO L87 Difference]: Start difference. First operand 1528 states and 2952 transitions. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:24:57,737 INFO L93 Difference]: Finished difference Result 2200 states and 4255 transitions. [2022-03-15 20:24:57,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:24:57,737 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 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 36 [2022-03-15 20:24:57,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:24:57,740 INFO L225 Difference]: With dead ends: 2200 [2022-03-15 20:24:57,740 INFO L226 Difference]: Without dead ends: 2200 [2022-03-15 20:24:57,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:24:57,741 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 460 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 2323 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 2383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:24:57,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [460 Valid, 222 Invalid, 2383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2323 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-03-15 20:24:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2022-03-15 20:24:57,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 1594. [2022-03-15 20:24:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1577 states have (on average 1.9556119213696892) internal successors, (3084), 1593 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 3084 transitions. [2022-03-15 20:24:57,757 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 3084 transitions. Word has length 36 [2022-03-15 20:24:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:24:57,757 INFO L470 AbstractCegarLoop]: Abstraction has 1594 states and 3084 transitions. [2022-03-15 20:24:57,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:24:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 3084 transitions. [2022-03-15 20:24:57,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:24:57,758 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:24:57,758 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:24:57,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-15 20:24:57,758 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:24:57,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:24:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1481368377, now seen corresponding path program 2 times [2022-03-15 20:24:57,759 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:24:57,759 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830582441] [2022-03-15 20:24:57,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:24:57,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:24:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:24:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:24:58,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:24:58,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830582441] [2022-03-15 20:24:58,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830582441] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:24:58,316 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:24:58,316 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 20:24:58,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [61029229] [2022-03-15 20:24:58,316 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:24:58,319 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:24:58,334 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 70 transitions. [2022-03-15 20:24:58,334 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:24:58,368 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:58,368 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:24:58,371 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:58,371 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:58,515 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:58,515 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:58,518 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:58,518 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:24:58,598 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:58,598 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:58,604 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:58,604 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:24:58,670 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:58,670 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:58,673 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:58,674 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:24:59,015 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:59,016 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:24:59,018 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:24:59,018 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:24:59,064 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [190068#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 190065#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 190063#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 190067#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 190056#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 190062#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 190061#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 190060#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 190057#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 190064#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 190059#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 190066#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 190058#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 190069#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1))] [2022-03-15 20:24:59,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 20:24:59,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:24:59,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 20:24:59,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:24:59,066 INFO L87 Difference]: Start difference. First operand 1594 states and 3084 transitions. Second operand has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 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-15 20:25:04,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:04,719 INFO L93 Difference]: Finished difference Result 2888 states and 5521 transitions. [2022-03-15 20:25:04,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 20:25:04,719 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 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 36 [2022-03-15 20:25:04,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:04,723 INFO L225 Difference]: With dead ends: 2888 [2022-03-15 20:25:04,723 INFO L226 Difference]: Without dead ends: 2888 [2022-03-15 20:25:04,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=489, Invalid=2591, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 20:25:04,724 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 638 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 3791 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 3993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:04,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 350 Invalid, 3993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3791 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-03-15 20:25:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2022-03-15 20:25:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1605. [2022-03-15 20:25:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1588 states have (on average 1.9584382871536523) internal successors, (3110), 1604 states have internal predecessors, (3110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 3110 transitions. [2022-03-15 20:25:04,769 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 3110 transitions. Word has length 36 [2022-03-15 20:25:04,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:04,770 INFO L470 AbstractCegarLoop]: Abstraction has 1605 states and 3110 transitions. [2022-03-15 20:25:04,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 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-15 20:25:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 3110 transitions. [2022-03-15 20:25:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:25:04,783 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:04,783 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:25:04,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-15 20:25:04,783 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:04,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1209973129, now seen corresponding path program 3 times [2022-03-15 20:25:04,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:04,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570517439] [2022-03-15 20:25:04,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:04,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:05,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:05,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570517439] [2022-03-15 20:25:05,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570517439] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:05,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:05,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 20:25:05,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [654709602] [2022-03-15 20:25:05,610 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:05,613 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:05,628 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 72 transitions. [2022-03-15 20:25:05,628 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:05,906 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:05,907 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:05,911 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:05,912 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 126 [2022-03-15 20:25:06,012 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:06,012 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 100 [2022-03-15 20:25:06,028 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:06,028 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:06,143 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:06,144 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:06,148 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:06,148 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2022-03-15 20:25:06,250 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:06,251 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2022-03-15 20:25:06,256 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:06,256 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:06,308 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:06,309 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:06,311 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:06,311 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:25:06,839 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [196242#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 196244#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 196250#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0))), 196237#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 196239#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 196245#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 196249#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 196241#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 196247#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 196248#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 196240#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 196243#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 196238#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 196246#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:25:06,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 20:25:06,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:06,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 20:25:06,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:25:06,840 INFO L87 Difference]: Start difference. First operand 1605 states and 3110 transitions. Second operand has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:12,993 INFO L93 Difference]: Finished difference Result 2620 states and 5038 transitions. [2022-03-15 20:25:12,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 20:25:12,998 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 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 36 [2022-03-15 20:25:12,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:13,001 INFO L225 Difference]: With dead ends: 2620 [2022-03-15 20:25:13,001 INFO L226 Difference]: Without dead ends: 2620 [2022-03-15 20:25:13,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=868, Invalid=3554, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 20:25:13,002 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 621 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 3934 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 4069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 3934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:13,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [621 Valid, 360 Invalid, 4069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 3934 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-03-15 20:25:13,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2022-03-15 20:25:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 1583. [2022-03-15 20:25:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1566 states have (on average 1.9578544061302683) internal successors, (3066), 1582 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 3066 transitions. [2022-03-15 20:25:13,020 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 3066 transitions. Word has length 36 [2022-03-15 20:25:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:13,020 INFO L470 AbstractCegarLoop]: Abstraction has 1583 states and 3066 transitions. [2022-03-15 20:25:13,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 3066 transitions. [2022-03-15 20:25:13,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:25:13,021 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:13,021 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:25:13,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-15 20:25:13,021 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:13,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:13,022 INFO L85 PathProgramCache]: Analyzing trace with hash -623682619, now seen corresponding path program 4 times [2022-03-15 20:25:13,026 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:13,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069152759] [2022-03-15 20:25:13,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:13,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:13,625 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:13,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069152759] [2022-03-15 20:25:13,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069152759] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:13,625 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:13,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:25:13,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2079043300] [2022-03-15 20:25:13,625 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:13,629 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:13,642 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 58 transitions. [2022-03-15 20:25:13,642 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:13,663 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:13,664 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:25:13,667 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:13,668 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:13,731 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:13,732 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:13,735 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:13,735 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:25:13,793 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:13,794 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:13,797 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:13,797 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:25:13,895 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [202127#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))))] [2022-03-15 20:25:13,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:25:13,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:13,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:25:13,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:25:13,895 INFO L87 Difference]: Start difference. First operand 1583 states and 3066 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:17,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:17,255 INFO L93 Difference]: Finished difference Result 1762 states and 3384 transitions. [2022-03-15 20:25:17,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 20:25:17,255 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 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 36 [2022-03-15 20:25:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:17,257 INFO L225 Difference]: With dead ends: 1762 [2022-03-15 20:25:17,257 INFO L226 Difference]: Without dead ends: 1762 [2022-03-15 20:25:17,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=593, Invalid=1569, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:25:17,258 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 296 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:17,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 146 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 20:25:17,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2022-03-15 20:25:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1584. [2022-03-15 20:25:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1567 states have (on average 1.9553286534779835) internal successors, (3064), 1583 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 3064 transitions. [2022-03-15 20:25:17,273 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 3064 transitions. Word has length 36 [2022-03-15 20:25:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:17,273 INFO L470 AbstractCegarLoop]: Abstraction has 1584 states and 3064 transitions. [2022-03-15 20:25:17,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 3064 transitions. [2022-03-15 20:25:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:25:17,274 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:17,274 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:25:17,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-15 20:25:17,274 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:17,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash -198590619, now seen corresponding path program 2 times [2022-03-15 20:25:17,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:17,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835474962] [2022-03-15 20:25:17,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:17,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:18,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:18,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835474962] [2022-03-15 20:25:18,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835474962] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:18,100 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:18,100 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:18,100 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1867190590] [2022-03-15 20:25:18,100 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:18,104 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:18,118 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 58 transitions. [2022-03-15 20:25:18,118 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:18,382 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [207134#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|) (= 0 |~#slot~0.offset|) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (or (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|))))] [2022-03-15 20:25:18,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:18,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:18,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:18,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:18,383 INFO L87 Difference]: Start difference. First operand 1584 states and 3064 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:21,349 INFO L93 Difference]: Finished difference Result 2149 states and 4167 transitions. [2022-03-15 20:25:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:25:21,349 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 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 36 [2022-03-15 20:25:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:21,352 INFO L225 Difference]: With dead ends: 2149 [2022-03-15 20:25:21,352 INFO L226 Difference]: Without dead ends: 2149 [2022-03-15 20:25:21,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:25:21,352 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 270 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:21,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 200 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 20:25:21,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2022-03-15 20:25:21,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 1615. [2022-03-15 20:25:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1598 states have (on average 1.9561952440550687) internal successors, (3126), 1614 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 3126 transitions. [2022-03-15 20:25:21,367 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 3126 transitions. Word has length 36 [2022-03-15 20:25:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:21,367 INFO L470 AbstractCegarLoop]: Abstraction has 1615 states and 3126 transitions. [2022-03-15 20:25:21,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 3126 transitions. [2022-03-15 20:25:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:25:21,368 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:21,368 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:25:21,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-15 20:25:21,369 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:21,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:21,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2040527519, now seen corresponding path program 3 times [2022-03-15 20:25:21,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:21,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463743825] [2022-03-15 20:25:21,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:21,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:21,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:21,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463743825] [2022-03-15 20:25:21,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463743825] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:21,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:21,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:21,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1933502697] [2022-03-15 20:25:21,788 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:21,792 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:21,805 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 52 transitions. [2022-03-15 20:25:21,805 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:21,895 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [212548#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|))] [2022-03-15 20:25:21,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:21,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:21,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:21,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:21,896 INFO L87 Difference]: Start difference. First operand 1615 states and 3126 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:24,588 INFO L93 Difference]: Finished difference Result 1985 states and 3816 transitions. [2022-03-15 20:25:24,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 20:25:24,588 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 20:25:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:24,590 INFO L225 Difference]: With dead ends: 1985 [2022-03-15 20:25:24,590 INFO L226 Difference]: Without dead ends: 1985 [2022-03-15 20:25:24,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:25:24,591 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 335 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:24,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 178 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 20:25:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2022-03-15 20:25:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1612. [2022-03-15 20:25:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1595 states have (on average 1.9561128526645768) internal successors, (3120), 1611 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 3120 transitions. [2022-03-15 20:25:24,605 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 3120 transitions. Word has length 36 [2022-03-15 20:25:24,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:24,605 INFO L470 AbstractCegarLoop]: Abstraction has 1612 states and 3120 transitions. [2022-03-15 20:25:24,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 3120 transitions. [2022-03-15 20:25:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:25:24,606 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:24,606 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:25:24,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-15 20:25:24,606 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:24,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:24,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1532962743, now seen corresponding path program 3 times [2022-03-15 20:25:24,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:24,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621331211] [2022-03-15 20:25:24,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:24,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:25,211 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:25,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:25,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621331211] [2022-03-15 20:25:25,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621331211] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:25,212 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:25,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 20:25:25,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1961515763] [2022-03-15 20:25:25,212 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:25,215 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:25,226 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 36 transitions. [2022-03-15 20:25:25,226 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:25,226 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:25,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:25:25,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:25,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:25:25,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:25:25,227 INFO L87 Difference]: Start difference. First operand 1612 states and 3120 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:28,926 INFO L93 Difference]: Finished difference Result 2829 states and 5403 transitions. [2022-03-15 20:25:28,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 20:25:28,927 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 20:25:28,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:28,929 INFO L225 Difference]: With dead ends: 2829 [2022-03-15 20:25:28,929 INFO L226 Difference]: Without dead ends: 2829 [2022-03-15 20:25:28,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=282, Invalid=1124, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 20:25:28,932 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 512 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:28,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 373 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 20:25:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2022-03-15 20:25:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 1535. [2022-03-15 20:25:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1519 states have (on average 1.9526003949967083) internal successors, (2966), 1534 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2966 transitions. [2022-03-15 20:25:28,947 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2966 transitions. Word has length 36 [2022-03-15 20:25:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:28,947 INFO L470 AbstractCegarLoop]: Abstraction has 1535 states and 2966 transitions. [2022-03-15 20:25:28,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2966 transitions. [2022-03-15 20:25:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:25:28,948 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:28,948 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:25:28,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-03-15 20:25:28,949 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:28,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:28,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1804357991, now seen corresponding path program 5 times [2022-03-15 20:25:28,950 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:28,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229449349] [2022-03-15 20:25:28,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:28,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:29,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:29,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229449349] [2022-03-15 20:25:29,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229449349] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:29,696 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:29,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 20:25:29,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1848918308] [2022-03-15 20:25:29,696 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:29,699 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:29,710 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 38 transitions. [2022-03-15 20:25:29,710 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:29,716 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:29,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:25:29,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:29,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:25:29,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:25:29,717 INFO L87 Difference]: Start difference. First operand 1535 states and 2966 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:35,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:35,765 INFO L93 Difference]: Finished difference Result 2651 states and 5092 transitions. [2022-03-15 20:25:35,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 20:25:35,766 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 20:25:35,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:35,768 INFO L225 Difference]: With dead ends: 2651 [2022-03-15 20:25:35,768 INFO L226 Difference]: Without dead ends: 2651 [2022-03-15 20:25:35,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=994, Invalid=2912, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 20:25:35,770 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 422 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 3311 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 3424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:35,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 441 Invalid, 3424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3311 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-03-15 20:25:35,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2651 states. [2022-03-15 20:25:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2651 to 1517. [2022-03-15 20:25:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1501 states have (on average 1.9520319786808795) internal successors, (2930), 1516 states have internal predecessors, (2930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2930 transitions. [2022-03-15 20:25:35,784 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2930 transitions. Word has length 36 [2022-03-15 20:25:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:35,785 INFO L470 AbstractCegarLoop]: Abstraction has 1517 states and 2930 transitions. [2022-03-15 20:25:35,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2930 transitions. [2022-03-15 20:25:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:25:35,786 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:35,786 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:25:35,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-15 20:25:35,786 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:35,786 INFO L85 PathProgramCache]: Analyzing trace with hash -479445217, now seen corresponding path program 6 times [2022-03-15 20:25:35,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:35,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121115552] [2022-03-15 20:25:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:35,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:36,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:36,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121115552] [2022-03-15 20:25:36,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121115552] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:36,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:36,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:25:36,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [994857563] [2022-03-15 20:25:36,388 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:36,393 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:36,405 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 36 transitions. [2022-03-15 20:25:36,406 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:36,406 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:36,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:25:36,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:36,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:25:36,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:25:36,407 INFO L87 Difference]: Start difference. First operand 1517 states and 2930 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:39,682 INFO L93 Difference]: Finished difference Result 2082 states and 4016 transitions. [2022-03-15 20:25:39,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 20:25:39,682 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 20:25:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:39,684 INFO L225 Difference]: With dead ends: 2082 [2022-03-15 20:25:39,684 INFO L226 Difference]: Without dead ends: 2082 [2022-03-15 20:25:39,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=560, Invalid=1510, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 20:25:39,685 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 317 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:39,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 197 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1799 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 20:25:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2022-03-15 20:25:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1454. [2022-03-15 20:25:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1439 states have (on average 1.9520500347463516) internal successors, (2809), 1453 states have internal predecessors, (2809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2809 transitions. [2022-03-15 20:25:39,698 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2809 transitions. Word has length 36 [2022-03-15 20:25:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:39,698 INFO L470 AbstractCegarLoop]: Abstraction has 1454 states and 2809 transitions. [2022-03-15 20:25:39,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2809 transitions. [2022-03-15 20:25:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:25:39,698 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:39,698 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:25:39,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-03-15 20:25:39,699 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:39,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:39,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1855585551, now seen corresponding path program 4 times [2022-03-15 20:25:39,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:39,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159671635] [2022-03-15 20:25:39,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:39,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:40,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:40,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159671635] [2022-03-15 20:25:40,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159671635] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:40,177 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:40,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:40,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1236544646] [2022-03-15 20:25:40,177 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:40,180 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:40,192 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 38 transitions. [2022-03-15 20:25:40,192 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:40,206 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [234614#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= 3 |~#slot~0.base|))] [2022-03-15 20:25:40,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:40,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:40,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:40,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:40,206 INFO L87 Difference]: Start difference. First operand 1454 states and 2809 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:42,148 INFO L93 Difference]: Finished difference Result 2153 states and 4157 transitions. [2022-03-15 20:25:42,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:25:42,148 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 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 36 [2022-03-15 20:25:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:42,151 INFO L225 Difference]: With dead ends: 2153 [2022-03-15 20:25:42,151 INFO L226 Difference]: Without dead ends: 2153 [2022-03-15 20:25:42,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:25:42,151 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 266 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:42,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 174 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 20:25:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2022-03-15 20:25:42,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 1442. [2022-03-15 20:25:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1427 states have (on average 1.951646811492642) internal successors, (2785), 1441 states have internal predecessors, (2785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2785 transitions. [2022-03-15 20:25:42,165 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2785 transitions. Word has length 36 [2022-03-15 20:25:42,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:42,165 INFO L470 AbstractCegarLoop]: Abstraction has 1442 states and 2785 transitions. [2022-03-15 20:25:42,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2785 transitions. [2022-03-15 20:25:42,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:25:42,166 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:42,166 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:25:42,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-03-15 20:25:42,166 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:42,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash -800113907, now seen corresponding path program 5 times [2022-03-15 20:25:42,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:42,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314544652] [2022-03-15 20:25:42,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:42,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:42,563 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:42,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314544652] [2022-03-15 20:25:42,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314544652] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:42,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:42,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:42,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1045518195] [2022-03-15 20:25:42,563 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:42,567 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:42,579 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 40 transitions. [2022-03-15 20:25:42,579 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:42,612 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [239685#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))), 239684#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)))] [2022-03-15 20:25:42,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:25:42,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:42,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:25:42,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:25:42,613 INFO L87 Difference]: Start difference. First operand 1442 states and 2785 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:45,822 INFO L93 Difference]: Finished difference Result 2129 states and 4109 transitions. [2022-03-15 20:25:45,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:25:45,822 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 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 36 [2022-03-15 20:25:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:45,825 INFO L225 Difference]: With dead ends: 2129 [2022-03-15 20:25:45,825 INFO L226 Difference]: Without dead ends: 2129 [2022-03-15 20:25:45,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:25:45,825 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 272 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:45,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 159 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 20:25:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2022-03-15 20:25:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1430. [2022-03-15 20:25:45,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1415 states have (on average 1.9512367491166078) internal successors, (2761), 1429 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2761 transitions. [2022-03-15 20:25:45,839 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2761 transitions. Word has length 36 [2022-03-15 20:25:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:45,839 INFO L470 AbstractCegarLoop]: Abstraction has 1430 states and 2761 transitions. [2022-03-15 20:25:45,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2761 transitions. [2022-03-15 20:25:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:25:45,840 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:45,840 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:25:45,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-03-15 20:25:45,840 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:45,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:45,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1171205327, now seen corresponding path program 6 times [2022-03-15 20:25:45,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:45,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890120755] [2022-03-15 20:25:45,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:45,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:46,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:46,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890120755] [2022-03-15 20:25:46,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890120755] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:46,514 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:46,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:46,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2128387591] [2022-03-15 20:25:46,514 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:46,518 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:46,530 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 42 transitions. [2022-03-15 20:25:46,530 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:46,616 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [244707#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 5)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= 3 |~#slot~0.base|)), 244708#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= 3 |~#slot~0.base|)), 244709#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= 3 |~#slot~0.base|))] [2022-03-15 20:25:46,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:25:46,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:46,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:25:46,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:25:46,617 INFO L87 Difference]: Start difference. First operand 1430 states and 2761 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:50,211 INFO L93 Difference]: Finished difference Result 2085 states and 4021 transitions. [2022-03-15 20:25:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:25:50,211 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 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 36 [2022-03-15 20:25:50,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:50,214 INFO L225 Difference]: With dead ends: 2085 [2022-03-15 20:25:50,214 INFO L226 Difference]: Without dead ends: 2085 [2022-03-15 20:25:50,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:25:50,214 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 283 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:50,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 174 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 20:25:50,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2022-03-15 20:25:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1402. [2022-03-15 20:25:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1387 states have (on average 1.950252343186734) internal successors, (2705), 1401 states have internal predecessors, (2705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2705 transitions. [2022-03-15 20:25:50,229 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2705 transitions. Word has length 36 [2022-03-15 20:25:50,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:50,229 INFO L470 AbstractCegarLoop]: Abstraction has 1402 states and 2705 transitions. [2022-03-15 20:25:50,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2705 transitions. [2022-03-15 20:25:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 20:25:50,231 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:50,231 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:25:50,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-15 20:25:50,231 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:50,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1928289044, now seen corresponding path program 1 times [2022-03-15 20:25:50,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:50,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723176719] [2022-03-15 20:25:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:50,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:50,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:50,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723176719] [2022-03-15 20:25:50,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723176719] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:50,375 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:50,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:25:50,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1355077442] [2022-03-15 20:25:50,375 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:50,379 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:50,389 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 37 transitions. [2022-03-15 20:25:50,389 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:50,389 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:50,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:25:50,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:50,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:25:50,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:25:50,390 INFO L87 Difference]: Start difference. First operand 1402 states and 2705 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:51,265 INFO L93 Difference]: Finished difference Result 1375 states and 2652 transitions. [2022-03-15 20:25:51,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:25:51,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-03-15 20:25:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:51,267 INFO L225 Difference]: With dead ends: 1375 [2022-03-15 20:25:51,267 INFO L226 Difference]: Without dead ends: 1375 [2022-03-15 20:25:51,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:25:51,268 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 42 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:51,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 63 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:25:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2022-03-15 20:25:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1375. [2022-03-15 20:25:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1362 states have (on average 1.947136563876652) internal successors, (2652), 1374 states have internal predecessors, (2652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2652 transitions. [2022-03-15 20:25:51,279 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2652 transitions. Word has length 37 [2022-03-15 20:25:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:51,279 INFO L470 AbstractCegarLoop]: Abstraction has 1375 states and 2652 transitions. [2022-03-15 20:25:51,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2652 transitions. [2022-03-15 20:25:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 20:25:51,280 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:51,280 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:25:51,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-15 20:25:51,280 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:51,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:51,280 INFO L85 PathProgramCache]: Analyzing trace with hash 617395112, now seen corresponding path program 1 times [2022-03-15 20:25:51,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:51,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421296413] [2022-03-15 20:25:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:51,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:51,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:51,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421296413] [2022-03-15 20:25:51,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421296413] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:51,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:51,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:51,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1977164577] [2022-03-15 20:25:51,679 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:51,684 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:51,702 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 67 transitions. [2022-03-15 20:25:51,702 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:51,888 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [253768#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|))] [2022-03-15 20:25:51,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:51,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:51,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:51,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:51,889 INFO L87 Difference]: Start difference. First operand 1375 states and 2652 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 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-15 20:25:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:53,731 INFO L93 Difference]: Finished difference Result 1747 states and 3347 transitions. [2022-03-15 20:25:53,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:25:53,732 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 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 41 [2022-03-15 20:25:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:53,733 INFO L225 Difference]: With dead ends: 1747 [2022-03-15 20:25:53,733 INFO L226 Difference]: Without dead ends: 1747 [2022-03-15 20:25:53,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:25:53,734 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 262 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:53,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 169 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 20:25:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2022-03-15 20:25:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1363. [2022-03-15 20:25:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1350 states have (on average 1.9466666666666668) internal successors, (2628), 1362 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2628 transitions. [2022-03-15 20:25:53,747 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2628 transitions. Word has length 41 [2022-03-15 20:25:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:53,747 INFO L470 AbstractCegarLoop]: Abstraction has 1363 states and 2628 transitions. [2022-03-15 20:25:53,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 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-15 20:25:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2628 transitions. [2022-03-15 20:25:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 20:25:53,748 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:53,748 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:25:53,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-03-15 20:25:53,748 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:53,748 INFO L85 PathProgramCache]: Analyzing trace with hash 498013170, now seen corresponding path program 2 times [2022-03-15 20:25:53,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:53,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851142668] [2022-03-15 20:25:53,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:53,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:54,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:54,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851142668] [2022-03-15 20:25:54,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851142668] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:54,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:54,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:54,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [501273625] [2022-03-15 20:25:54,613 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:54,617 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:54,636 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 69 transitions. [2022-03-15 20:25:54,636 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:55,017 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [258274#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 5))) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 1) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))] [2022-03-15 20:25:55,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:55,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:55,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:55,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:55,018 INFO L87 Difference]: Start difference. First operand 1363 states and 2628 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:58,256 INFO L93 Difference]: Finished difference Result 2029 states and 3933 transitions. [2022-03-15 20:25:58,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 20:25:58,256 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-03-15 20:25:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:58,258 INFO L225 Difference]: With dead ends: 2029 [2022-03-15 20:25:58,259 INFO L226 Difference]: Without dead ends: 2029 [2022-03-15 20:25:58,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:25:58,259 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 252 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:58,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 189 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-03-15 20:25:58,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2022-03-15 20:25:58,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1374. [2022-03-15 20:25:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1361 states have (on average 1.947097722263042) internal successors, (2650), 1373 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:58,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2650 transitions. [2022-03-15 20:25:58,272 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2650 transitions. Word has length 41 [2022-03-15 20:25:58,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:58,272 INFO L470 AbstractCegarLoop]: Abstraction has 1374 states and 2650 transitions. [2022-03-15 20:25:58,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:25:58,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2650 transitions. [2022-03-15 20:25:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 20:25:58,273 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:58,273 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:25:58,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-03-15 20:25:58,273 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:25:58,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:58,274 INFO L85 PathProgramCache]: Analyzing trace with hash 798707466, now seen corresponding path program 3 times [2022-03-15 20:25:58,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:58,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978739318] [2022-03-15 20:25:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:58,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:25:58,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:58,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978739318] [2022-03-15 20:25:58,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978739318] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:58,692 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:58,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:58,692 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1957645904] [2022-03-15 20:25:58,692 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:58,697 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:58,715 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 71 transitions. [2022-03-15 20:25:58,715 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:58,953 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [263088#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))] [2022-03-15 20:25:58,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:58,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:58,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:58,953 INFO L87 Difference]: Start difference. First operand 1374 states and 2650 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:02,226 INFO L93 Difference]: Finished difference Result 1692 states and 3237 transitions. [2022-03-15 20:26:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:26:02,226 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-03-15 20:26:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:02,228 INFO L225 Difference]: With dead ends: 1692 [2022-03-15 20:26:02,228 INFO L226 Difference]: Without dead ends: 1692 [2022-03-15 20:26:02,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:26:02,229 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 324 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:02,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 163 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-03-15 20:26:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2022-03-15 20:26:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1302. [2022-03-15 20:26:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1289 states have (on average 1.9441427463149727) internal successors, (2506), 1301 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 2506 transitions. [2022-03-15 20:26:02,240 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 2506 transitions. Word has length 41 [2022-03-15 20:26:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:02,240 INFO L470 AbstractCegarLoop]: Abstraction has 1302 states and 2506 transitions. [2022-03-15 20:26:02,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 2506 transitions. [2022-03-15 20:26:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:26:02,241 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:02,241 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:26:02,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-03-15 20:26:02,241 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:02,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash -521824882, now seen corresponding path program 1 times [2022-03-15 20:26:02,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:02,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13290856] [2022-03-15 20:26:02,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:02,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:02,827 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:02,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13290856] [2022-03-15 20:26:02,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13290856] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:02,827 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:02,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:02,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1616327301] [2022-03-15 20:26:02,827 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:02,847 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:02,887 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 94 transitions. [2022-03-15 20:26:02,887 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:03,679 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [267452#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))), 267446#(not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)), 267449#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 267445#(or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 267453#(not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0)), 267444#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 267434#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 267441#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 267447#(not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)), 267442#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 267450#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 267448#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 267443#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem50#1.base|) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 267436#(not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)), 267440#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 267433#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 267438#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 267432#(or (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 6)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 5 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|)) 0)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 267437#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)), 267439#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 267451#(or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))), 267435#(or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= (select (select |#race| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)))] [2022-03-15 20:26:03,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 20:26:03,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:03,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 20:26:03,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:26:03,680 INFO L87 Difference]: Start difference. First operand 1302 states and 2506 transitions. Second operand has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 34 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:12,091 INFO L93 Difference]: Finished difference Result 2030 states and 3861 transitions. [2022-03-15 20:26:12,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 20:26:12,091 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 34 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:26:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:12,094 INFO L225 Difference]: With dead ends: 2030 [2022-03-15 20:26:12,094 INFO L226 Difference]: Without dead ends: 2030 [2022-03-15 20:26:12,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=517, Invalid=2905, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 20:26:12,095 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 596 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 3634 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:12,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 330 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3634 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-03-15 20:26:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2022-03-15 20:26:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 1392. [2022-03-15 20:26:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1379 states have (on average 1.9477882523567802) internal successors, (2686), 1391 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2686 transitions. [2022-03-15 20:26:12,109 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2686 transitions. Word has length 42 [2022-03-15 20:26:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:12,109 INFO L470 AbstractCegarLoop]: Abstraction has 1392 states and 2686 transitions. [2022-03-15 20:26:12,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 34 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2686 transitions. [2022-03-15 20:26:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:26:12,110 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:12,110 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:26:12,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-03-15 20:26:12,110 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:12,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:12,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1366217228, now seen corresponding path program 2 times [2022-03-15 20:26:12,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:12,111 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965651729] [2022-03-15 20:26:12,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:12,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:12,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:12,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965651729] [2022-03-15 20:26:12,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965651729] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:12,617 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:12,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:26:12,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1504305324] [2022-03-15 20:26:12,617 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:12,621 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:12,647 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 100 transitions. [2022-03-15 20:26:12,647 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:13,693 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [272336#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 272334#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 272330#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)), 272335#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 272337#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 272338#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 272331#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 272339#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))), 272333#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4))), 272340#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) 0))), 272332#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:26:13,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:26:13,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:13,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:26:13,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:26:13,694 INFO L87 Difference]: Start difference. First operand 1392 states and 2686 transitions. Second operand has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:18,903 INFO L93 Difference]: Finished difference Result 1730 states and 3326 transitions. [2022-03-15 20:26:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:26:18,903 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:26:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:18,905 INFO L225 Difference]: With dead ends: 1730 [2022-03-15 20:26:18,905 INFO L226 Difference]: Without dead ends: 1730 [2022-03-15 20:26:18,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 14 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=271, Invalid=1451, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:26:18,906 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 277 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 2008 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:18,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 241 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2008 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-03-15 20:26:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2022-03-15 20:26:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1393. [2022-03-15 20:26:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1380 states have (on average 1.9478260869565218) internal successors, (2688), 1392 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 2688 transitions. [2022-03-15 20:26:18,918 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 2688 transitions. Word has length 42 [2022-03-15 20:26:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:18,918 INFO L470 AbstractCegarLoop]: Abstraction has 1393 states and 2688 transitions. [2022-03-15 20:26:18,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 2688 transitions. [2022-03-15 20:26:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:26:18,919 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:18,919 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:26:18,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-03-15 20:26:18,919 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:18,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:18,919 INFO L85 PathProgramCache]: Analyzing trace with hash -497828362, now seen corresponding path program 3 times [2022-03-15 20:26:18,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:18,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275548115] [2022-03-15 20:26:18,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:18,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:19,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:19,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275548115] [2022-03-15 20:26:19,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275548115] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:19,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:19,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:19,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910287321] [2022-03-15 20:26:19,439 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:19,444 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:19,469 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 98 transitions. [2022-03-15 20:26:19,469 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:20,247 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [276904#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)), 276912#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 276906#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 276907#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 276913#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))), 276909#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 276908#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 276911#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 276910#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 276905#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:26:20,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:26:20,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:20,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:26:20,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:26:20,248 INFO L87 Difference]: Start difference. First operand 1393 states and 2688 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:25,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:25,802 INFO L93 Difference]: Finished difference Result 1712 states and 3292 transitions. [2022-03-15 20:26:25,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:26:25,803 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:26:25,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:25,805 INFO L225 Difference]: With dead ends: 1712 [2022-03-15 20:26:25,805 INFO L226 Difference]: Without dead ends: 1712 [2022-03-15 20:26:25,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 14 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 20:26:25,805 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 248 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:25,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 283 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-03-15 20:26:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-03-15 20:26:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1394. [2022-03-15 20:26:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1381 states have (on average 1.947863866763215) internal successors, (2690), 1393 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2690 transitions. [2022-03-15 20:26:25,817 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2690 transitions. Word has length 42 [2022-03-15 20:26:25,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:25,817 INFO L470 AbstractCegarLoop]: Abstraction has 1394 states and 2690 transitions. [2022-03-15 20:26:25,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2690 transitions. [2022-03-15 20:26:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:26:25,818 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:25,818 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:26:25,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-03-15 20:26:25,818 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:25,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:25,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1636099794, now seen corresponding path program 4 times [2022-03-15 20:26:25,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:25,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608188594] [2022-03-15 20:26:25,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:25,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:26,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:26,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608188594] [2022-03-15 20:26:26,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608188594] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:26,698 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:26,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:26:26,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1072234786] [2022-03-15 20:26:26,698 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:26,702 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:26,727 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 96 transitions. [2022-03-15 20:26:26,727 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:27,812 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [281464#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 6) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))))) (or (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 7) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 5) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))))) (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 281468#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)), 281469#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)), 281467#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)), 281465#(and (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 5) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 6) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 7))) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 281463#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 6) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))))) (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 5) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 7) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 281461#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 7) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 6) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))))) (or (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 5) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 281466#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)), 281470#(<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) 0), 281460#(and (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 7) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 5) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 6) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))))), 281462#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 6) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 5) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 7) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:26:27,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:26:27,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:27,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:26:27,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:26:27,813 INFO L87 Difference]: Start difference. First operand 1394 states and 2690 transitions. Second operand has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:34,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:34,950 INFO L93 Difference]: Finished difference Result 1666 states and 3207 transitions. [2022-03-15 20:26:34,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:26:34,951 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:26:34,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:34,953 INFO L225 Difference]: With dead ends: 1666 [2022-03-15 20:26:34,953 INFO L226 Difference]: Without dead ends: 1666 [2022-03-15 20:26:34,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=275, Invalid=1531, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 20:26:34,953 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 271 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 2542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:34,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 292 Invalid, 2542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-03-15 20:26:34,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2022-03-15 20:26:34,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1400. [2022-03-15 20:26:34,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1387 states have (on average 1.9480894015861572) internal successors, (2702), 1399 states have internal predecessors, (2702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 2702 transitions. [2022-03-15 20:26:34,965 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 2702 transitions. Word has length 42 [2022-03-15 20:26:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:34,965 INFO L470 AbstractCegarLoop]: Abstraction has 1400 states and 2702 transitions. [2022-03-15 20:26:34,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:34,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 2702 transitions. [2022-03-15 20:26:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:26:34,966 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:34,966 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:26:34,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-03-15 20:26:34,966 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:34,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:34,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1171041878, now seen corresponding path program 5 times [2022-03-15 20:26:34,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:34,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666125111] [2022-03-15 20:26:34,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:34,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:35,580 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:35,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666125111] [2022-03-15 20:26:35,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666125111] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:35,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:35,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:26:35,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [820600809] [2022-03-15 20:26:35,580 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:35,584 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:35,610 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 94 transitions. [2022-03-15 20:26:35,610 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:36,553 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [285997#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1)), 285991#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 285996#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (+ 7 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 285995#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 285987#(and (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4))) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 285992#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 |ULTIMATE.start_main_#t~mem49#1.offset|))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 285990#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 285989#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 |ULTIMATE.start_main_#t~mem49#1.offset|))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 285988#(and (or (not (= (+ 7 |ULTIMATE.start_main_#t~mem49#1.offset|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4))) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 285993#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 285994#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 3 |ULTIMATE.start_main_#t~mem49#1.offset|))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))))] [2022-03-15 20:26:36,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:26:36,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:36,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:26:36,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:26:36,554 INFO L87 Difference]: Start difference. First operand 1400 states and 2702 transitions. Second operand has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:42,323 INFO L93 Difference]: Finished difference Result 1803 states and 3465 transitions. [2022-03-15 20:26:42,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:26:42,323 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:26:42,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:42,325 INFO L225 Difference]: With dead ends: 1803 [2022-03-15 20:26:42,325 INFO L226 Difference]: Without dead ends: 1803 [2022-03-15 20:26:42,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=1451, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:26:42,325 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 309 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:42,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 246 Invalid, 2216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2145 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-03-15 20:26:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2022-03-15 20:26:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1402. [2022-03-15 20:26:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1389 states have (on average 1.9481641468682505) internal successors, (2706), 1401 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2706 transitions. [2022-03-15 20:26:42,341 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2706 transitions. Word has length 42 [2022-03-15 20:26:42,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:42,341 INFO L470 AbstractCegarLoop]: Abstraction has 1402 states and 2706 transitions. [2022-03-15 20:26:42,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2706 transitions. [2022-03-15 20:26:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:26:42,342 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:42,342 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:26:42,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-03-15 20:26:42,342 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:42,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:42,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2039430744, now seen corresponding path program 6 times [2022-03-15 20:26:42,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:42,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273515477] [2022-03-15 20:26:42,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:42,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:42,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:42,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273515477] [2022-03-15 20:26:42,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273515477] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:42,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:42,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:26:42,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [812069909] [2022-03-15 20:26:42,943 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:42,948 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:42,971 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 92 transitions. [2022-03-15 20:26:42,972 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:44,058 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [290659#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 290663#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1)), 290662#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 290656#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 290653#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 290661#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 290660#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 290654#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 290657#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 290658#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 290655#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:26:44,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:26:44,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:44,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:26:44,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:26:44,058 INFO L87 Difference]: Start difference. First operand 1402 states and 2706 transitions. Second operand has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:48,494 INFO L93 Difference]: Finished difference Result 1897 states and 3659 transitions. [2022-03-15 20:26:48,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:26:48,495 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:26:48,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:48,497 INFO L225 Difference]: With dead ends: 1897 [2022-03-15 20:26:48,497 INFO L226 Difference]: Without dead ends: 1897 [2022-03-15 20:26:48,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=363, Invalid=1443, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 20:26:48,497 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 434 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:48,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 255 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-03-15 20:26:48,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-03-15 20:26:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1453. [2022-03-15 20:26:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1440 states have (on average 1.95) internal successors, (2808), 1452 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2808 transitions. [2022-03-15 20:26:48,510 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2808 transitions. Word has length 42 [2022-03-15 20:26:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:48,510 INFO L470 AbstractCegarLoop]: Abstraction has 1453 states and 2808 transitions. [2022-03-15 20:26:48,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2808 transitions. [2022-03-15 20:26:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:26:48,511 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:48,511 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:26:48,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-03-15 20:26:48,512 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:48,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:48,512 INFO L85 PathProgramCache]: Analyzing trace with hash -121608396, now seen corresponding path program 7 times [2022-03-15 20:26:48,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:48,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432086091] [2022-03-15 20:26:48,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:48,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:49,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:49,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432086091] [2022-03-15 20:26:49,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432086091] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:49,715 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:49,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:26:49,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1976346630] [2022-03-15 20:26:49,715 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:49,720 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:49,742 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 90 transitions. [2022-03-15 20:26:49,743 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:50,812 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [295526#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 7)))), 295523#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 7) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 295522#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 7) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 295519#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 7) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 295521#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0))), 295525#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 295518#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 7) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 295524#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 295517#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 7) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 295520#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 295527#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1) (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) 0))] [2022-03-15 20:26:50,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:26:50,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:50,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:26:50,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:26:50,814 INFO L87 Difference]: Start difference. First operand 1453 states and 2808 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:56,313 INFO L93 Difference]: Finished difference Result 1838 states and 3548 transitions. [2022-03-15 20:26:56,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:26:56,314 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:26:56,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:56,316 INFO L225 Difference]: With dead ends: 1838 [2022-03-15 20:26:56,316 INFO L226 Difference]: Without dead ends: 1838 [2022-03-15 20:26:56,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=388, Invalid=1504, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:26:56,316 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 429 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:56,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 254 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-03-15 20:26:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-03-15 20:26:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1455. [2022-03-15 20:26:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1442 states have (on average 1.9500693481276006) internal successors, (2812), 1454 states have internal predecessors, (2812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2812 transitions. [2022-03-15 20:26:56,329 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2812 transitions. Word has length 42 [2022-03-15 20:26:56,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:56,329 INFO L470 AbstractCegarLoop]: Abstraction has 1455 states and 2812 transitions. [2022-03-15 20:26:56,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2812 transitions. [2022-03-15 20:26:56,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:26:56,330 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:56,330 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:26:56,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-03-15 20:26:56,330 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:26:56,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash -639842124, now seen corresponding path program 8 times [2022-03-15 20:26:56,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:56,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362023600] [2022-03-15 20:26:56,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:56,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:26:57,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:57,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362023600] [2022-03-15 20:26:57,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362023600] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:57,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:57,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:26:57,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [489063545] [2022-03-15 20:26:57,046 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:57,050 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:57,073 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 88 transitions. [2022-03-15 20:26:57,074 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:57,971 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [300334#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 300331#(and (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 300336#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 300330#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 300337#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 300332#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))) (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 300328#(and (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 300329#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 300333#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 300335#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 300338#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1))] [2022-03-15 20:26:57,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:26:57,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:57,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:26:57,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:26:57,973 INFO L87 Difference]: Start difference. First operand 1455 states and 2812 transitions. Second operand has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:02,754 INFO L93 Difference]: Finished difference Result 1844 states and 3551 transitions. [2022-03-15 20:27:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 20:27:02,754 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:27:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:02,756 INFO L225 Difference]: With dead ends: 1844 [2022-03-15 20:27:02,756 INFO L226 Difference]: Without dead ends: 1844 [2022-03-15 20:27:02,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=308, Invalid=1584, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:27:02,757 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 371 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:02,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 250 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2177 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-03-15 20:27:02,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2022-03-15 20:27:02,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1462. [2022-03-15 20:27:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1449 states have (on average 1.950310559006211) internal successors, (2826), 1461 states have internal predecessors, (2826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:02,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 2826 transitions. [2022-03-15 20:27:02,769 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 2826 transitions. Word has length 42 [2022-03-15 20:27:02,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:02,769 INFO L470 AbstractCegarLoop]: Abstraction has 1462 states and 2826 transitions. [2022-03-15 20:27:02,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 2826 transitions. [2022-03-15 20:27:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:27:02,770 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:02,770 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:27:02,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-03-15 20:27:02,770 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:02,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:02,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1902432268, now seen corresponding path program 9 times [2022-03-15 20:27:02,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:02,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274040476] [2022-03-15 20:27:02,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:02,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:03,389 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:03,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274040476] [2022-03-15 20:27:03,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274040476] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:03,389 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:03,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:27:03,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369284163] [2022-03-15 20:27:03,389 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:03,394 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:03,424 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 76 transitions. [2022-03-15 20:27:03,424 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:04,141 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [305169#(and (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0))), 305166#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 305162#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 305168#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 305161#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 305167#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 305159#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 305164#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 305163#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 305160#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 305165#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:27:04,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:27:04,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:04,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:27:04,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:27:04,141 INFO L87 Difference]: Start difference. First operand 1462 states and 2826 transitions. Second operand has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:09,460 INFO L93 Difference]: Finished difference Result 1914 states and 3691 transitions. [2022-03-15 20:27:09,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 20:27:09,460 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:27:09,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:09,462 INFO L225 Difference]: With dead ends: 1914 [2022-03-15 20:27:09,462 INFO L226 Difference]: Without dead ends: 1914 [2022-03-15 20:27:09,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:27:09,463 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 469 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 2063 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:09,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 222 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2063 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-03-15 20:27:09,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2022-03-15 20:27:09,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1453. [2022-03-15 20:27:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1440 states have (on average 1.95) internal successors, (2808), 1452 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2808 transitions. [2022-03-15 20:27:09,475 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2808 transitions. Word has length 42 [2022-03-15 20:27:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:09,475 INFO L470 AbstractCegarLoop]: Abstraction has 1453 states and 2808 transitions. [2022-03-15 20:27:09,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2808 transitions. [2022-03-15 20:27:09,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:27:09,476 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:09,476 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:27:09,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-03-15 20:27:09,477 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:09,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:09,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1955620786, now seen corresponding path program 10 times [2022-03-15 20:27:09,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:09,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815138544] [2022-03-15 20:27:09,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:09,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:10,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:10,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815138544] [2022-03-15 20:27:10,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815138544] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:10,874 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:10,874 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 20:27:10,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [824292011] [2022-03-15 20:27:10,874 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:10,878 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:10,900 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 86 transitions. [2022-03-15 20:27:10,900 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:10,973 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:10,973 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:10,983 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:10,984 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:27:11,351 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:11,352 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:27:11,355 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:11,355 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:11,689 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:11,689 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:11,698 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:11,699 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:27:11,964 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:11,964 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:27:11,969 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:11,969 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:12,164 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:12,165 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:27:12,167 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:12,168 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:12,340 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [310052#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))), 310046#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 310047#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 310049#(or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 310054#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 310043#(or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))), 310048#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 310053#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 310051#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 310050#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 310056#(and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) 0)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))), 310045#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4))), 310055#(and (or (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (or (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0))), 310044#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) |t_funThread1of1ForFork0_new_~p~0#1.offset|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:27:12,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 20:27:12,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:12,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 20:27:12,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:27:12,340 INFO L87 Difference]: Start difference. First operand 1453 states and 2808 transitions. Second operand has 29 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 28 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:18,930 INFO L93 Difference]: Finished difference Result 2235 states and 4285 transitions. [2022-03-15 20:27:18,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 20:27:18,930 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 28 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:27:18,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:18,932 INFO L225 Difference]: With dead ends: 2235 [2022-03-15 20:27:18,932 INFO L226 Difference]: Without dead ends: 2235 [2022-03-15 20:27:18,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=439, Invalid=2213, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 20:27:18,933 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 389 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 2660 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:18,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 389 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2660 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-03-15 20:27:18,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2022-03-15 20:27:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 1423. [2022-03-15 20:27:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1410 states have (on average 1.9489361702127659) internal successors, (2748), 1422 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2748 transitions. [2022-03-15 20:27:18,956 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 2748 transitions. Word has length 42 [2022-03-15 20:27:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:18,956 INFO L470 AbstractCegarLoop]: Abstraction has 1423 states and 2748 transitions. [2022-03-15 20:27:18,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 28 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:18,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2748 transitions. [2022-03-15 20:27:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:27:18,957 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:18,957 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:27:18,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-03-15 20:27:18,966 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:18,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:18,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1136032194, now seen corresponding path program 11 times [2022-03-15 20:27:18,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:18,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617210880] [2022-03-15 20:27:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:19,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:19,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617210880] [2022-03-15 20:27:19,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617210880] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:19,903 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:19,903 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:27:19,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [980653203] [2022-03-15 20:27:19,903 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:19,907 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:19,929 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 80 transitions. [2022-03-15 20:27:19,929 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:20,316 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:20,317 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 239 [2022-03-15 20:27:20,344 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:20,344 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:20,412 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:20,412 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:20,416 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:20,417 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 187 [2022-03-15 20:27:20,494 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:20,495 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 135 [2022-03-15 20:27:20,511 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:20,513 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:20,560 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:20,561 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:20,564 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:20,564 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 83 [2022-03-15 20:27:20,592 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:20,593 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:20,595 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:20,595 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:27:21,367 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [315207#(and (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0)) (< 0 (+ 1 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) (<= (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 315208#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))), 315209#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))), 315206#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 315203#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 315205#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 315199#(and (or (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 315200#(and (or (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 315201#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))) (or (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 315202#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (< 0 (+ 1 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) (<= (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 315198#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 315204#(and (or (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:27:21,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:27:21,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:21,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:27:21,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:27:21,368 INFO L87 Difference]: Start difference. First operand 1423 states and 2748 transitions. Second operand has 26 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:27,710 INFO L93 Difference]: Finished difference Result 1980 states and 3832 transitions. [2022-03-15 20:27:27,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:27:27,711 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:27:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:27,713 INFO L225 Difference]: With dead ends: 1980 [2022-03-15 20:27:27,713 INFO L226 Difference]: Without dead ends: 1980 [2022-03-15 20:27:27,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:27:27,713 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 444 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:27,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [444 Valid, 264 Invalid, 2873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-03-15 20:27:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2022-03-15 20:27:27,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1442. [2022-03-15 20:27:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1429 states have (on average 1.9496151154653605) internal successors, (2786), 1441 states have internal predecessors, (2786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2786 transitions. [2022-03-15 20:27:27,733 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2786 transitions. Word has length 42 [2022-03-15 20:27:27,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:27,733 INFO L470 AbstractCegarLoop]: Abstraction has 1442 states and 2786 transitions. [2022-03-15 20:27:27,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2786 transitions. [2022-03-15 20:27:27,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:27:27,734 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:27,734 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:27:27,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-03-15 20:27:27,734 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:27,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:27,734 INFO L85 PathProgramCache]: Analyzing trace with hash 92174140, now seen corresponding path program 12 times [2022-03-15 20:27:27,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:27,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176325035] [2022-03-15 20:27:27,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:27,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:28,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:28,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176325035] [2022-03-15 20:27:28,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176325035] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:28,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:28,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:27:28,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [790621657] [2022-03-15 20:27:28,399 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:28,403 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:28,424 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 82 transitions. [2022-03-15 20:27:28,425 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:28,718 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:28,718 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 184 [2022-03-15 20:27:28,737 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:28,737 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:28,834 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:28,835 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 143 [2022-03-15 20:27:28,852 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:28,852 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:28,914 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:28,915 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2022-03-15 20:27:28,928 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:28,929 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:28,974 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:28,974 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2022-03-15 20:27:28,993 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:28,993 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:29,408 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:29,409 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:29,412 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:29,412 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:27:29,732 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [320125#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 320127#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) 4) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 320124#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 320123#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 320130#(and (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) 4) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 320126#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 320131#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))), 320128#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) 4) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 320133#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0)), 320132#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0)), 320129#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) 4) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:27:29,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 20:27:29,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:29,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 20:27:29,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:27:29,733 INFO L87 Difference]: Start difference. First operand 1442 states and 2786 transitions. Second operand has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:33,560 INFO L93 Difference]: Finished difference Result 1993 states and 3856 transitions. [2022-03-15 20:27:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:27:33,560 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:27:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:33,563 INFO L225 Difference]: With dead ends: 1993 [2022-03-15 20:27:33,563 INFO L226 Difference]: Without dead ends: 1993 [2022-03-15 20:27:33,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=407, Invalid=1485, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:27:33,563 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 443 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:33,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 180 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1941 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 20:27:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2022-03-15 20:27:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1437. [2022-03-15 20:27:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1424 states have (on average 1.949438202247191) internal successors, (2776), 1436 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2776 transitions. [2022-03-15 20:27:33,576 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2776 transitions. Word has length 42 [2022-03-15 20:27:33,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:33,576 INFO L470 AbstractCegarLoop]: Abstraction has 1437 states and 2776 transitions. [2022-03-15 20:27:33,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:33,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2776 transitions. [2022-03-15 20:27:33,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:27:33,577 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:33,577 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:27:33,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-03-15 20:27:33,577 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:33,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1998454142, now seen corresponding path program 13 times [2022-03-15 20:27:33,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:33,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447139047] [2022-03-15 20:27:33,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:33,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:34,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:34,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447139047] [2022-03-15 20:27:34,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447139047] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:34,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:34,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:27:34,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1279041108] [2022-03-15 20:27:34,407 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:34,411 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:34,433 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 84 transitions. [2022-03-15 20:27:34,433 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:34,719 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:34,720 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:34,727 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:34,728 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 239 [2022-03-15 20:27:34,793 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:34,794 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:34,797 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:34,798 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 187 [2022-03-15 20:27:34,992 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:34,992 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 135 [2022-03-15 20:27:35,010 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:35,011 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:35,144 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:35,145 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 83 [2022-03-15 20:27:35,157 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:35,158 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:35,800 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:35,801 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:27:35,803 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:35,804 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:36,080 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [325056#(and (or (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 325065#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))), 325062#(and (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 325055#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 325063#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (< 0 (+ 1 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) (<= (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 325066#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|))), 325058#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))) (or (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 325064#(and (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 0)) (< 0 (+ 1 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) (<= (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)), 325057#(and (or (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 325061#(and (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 325059#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 325060#(and (or (<= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (< 0 (+ |ULTIMATE.start_main_#t~mem49#1.offset| 1)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:27:36,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:27:36,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:36,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:27:36,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:27:36,081 INFO L87 Difference]: Start difference. First operand 1437 states and 2776 transitions. Second operand has 26 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:42,032 INFO L93 Difference]: Finished difference Result 2045 states and 3953 transitions. [2022-03-15 20:27:42,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:27:42,033 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:27:42,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:42,034 INFO L225 Difference]: With dead ends: 2045 [2022-03-15 20:27:42,035 INFO L226 Difference]: Without dead ends: 2045 [2022-03-15 20:27:42,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 20:27:42,035 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 375 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 2772 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 2860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 2772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:42,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 311 Invalid, 2860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 2772 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-03-15 20:27:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2022-03-15 20:27:42,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1432. [2022-03-15 20:27:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1419 states have (on average 1.9492600422832982) internal successors, (2766), 1431 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2766 transitions. [2022-03-15 20:27:42,047 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2766 transitions. Word has length 42 [2022-03-15 20:27:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:42,047 INFO L470 AbstractCegarLoop]: Abstraction has 1432 states and 2766 transitions. [2022-03-15 20:27:42,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2766 transitions. [2022-03-15 20:27:42,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:27:42,048 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:42,048 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:27:42,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-03-15 20:27:42,048 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:42,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:42,049 INFO L85 PathProgramCache]: Analyzing trace with hash 231568600, now seen corresponding path program 14 times [2022-03-15 20:27:42,049 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:42,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324870914] [2022-03-15 20:27:42,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:42,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:42,828 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:42,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324870914] [2022-03-15 20:27:42,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324870914] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:42,829 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:42,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:27:42,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1184488581] [2022-03-15 20:27:42,829 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:42,833 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:42,854 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 82 transitions. [2022-03-15 20:27:42,854 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:43,124 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:43,125 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 184 [2022-03-15 20:27:43,147 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:43,148 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:43,192 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:43,192 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:43,198 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:43,199 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 143 [2022-03-15 20:27:43,286 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:43,287 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2022-03-15 20:27:43,303 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:43,303 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:43,939 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:43,940 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:43,942 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:43,943 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2022-03-15 20:27:43,961 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:43,962 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:27:43,963 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:43,964 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:44,095 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [330031#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 330028#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 330030#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 330029#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 330032#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 330035#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0)), 330040#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1)), 330037#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 330038#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))), 330036#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0)), 330033#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 330039#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 330034#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 5)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0))] [2022-03-15 20:27:44,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 20:27:44,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:44,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 20:27:44,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:27:44,096 INFO L87 Difference]: Start difference. First operand 1432 states and 2766 transitions. Second operand has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:49,146 INFO L93 Difference]: Finished difference Result 1963 states and 3798 transitions. [2022-03-15 20:27:49,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:27:49,146 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:27:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:49,148 INFO L225 Difference]: With dead ends: 1963 [2022-03-15 20:27:49,148 INFO L226 Difference]: Without dead ends: 1963 [2022-03-15 20:27:49,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:27:49,149 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 421 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 2640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:49,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 221 Invalid, 2640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2553 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-03-15 20:27:49,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2022-03-15 20:27:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1441. [2022-03-15 20:27:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1428 states have (on average 1.949579831932773) internal successors, (2784), 1440 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2784 transitions. [2022-03-15 20:27:49,161 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2784 transitions. Word has length 42 [2022-03-15 20:27:49,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:49,161 INFO L470 AbstractCegarLoop]: Abstraction has 1441 states and 2784 transitions. [2022-03-15 20:27:49,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2784 transitions. [2022-03-15 20:27:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:27:49,162 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:49,162 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:27:49,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-03-15 20:27:49,162 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:49,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:49,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1459774934, now seen corresponding path program 15 times [2022-03-15 20:27:49,170 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:49,171 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530604208] [2022-03-15 20:27:49,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:49,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:49,979 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:49,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530604208] [2022-03-15 20:27:49,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530604208] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:49,979 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:49,979 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:27:49,979 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1287825650] [2022-03-15 20:27:49,979 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:49,984 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:50,005 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 84 transitions. [2022-03-15 20:27:50,006 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:50,346 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:50,347 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:50,350 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:50,350 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 182 [2022-03-15 20:27:50,412 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:50,413 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 143 [2022-03-15 20:27:50,430 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:50,430 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:50,485 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:50,486 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2022-03-15 20:27:50,497 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:50,497 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:50,591 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:50,591 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2022-03-15 20:27:50,599 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:50,600 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:50,622 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:50,622 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:50,624 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:50,625 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:27:51,174 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [334949#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 334950#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 334942#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0)), 334948#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 334947#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 334951#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))))), 334943#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 334945#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 334940#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 5)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0)), 334944#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 334941#(and (= (select (select |#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4)) |t_funThread1of1ForFork0_new_#t~nondet32#1|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0)), 334952#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1)), 334946#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))))] [2022-03-15 20:27:51,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 20:27:51,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:51,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 20:27:51,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:27:51,174 INFO L87 Difference]: Start difference. First operand 1441 states and 2784 transitions. Second operand has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:27:57,217 INFO L93 Difference]: Finished difference Result 1976 states and 3822 transitions. [2022-03-15 20:27:57,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 20:27:57,217 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:27:57,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:27:57,219 INFO L225 Difference]: With dead ends: 1976 [2022-03-15 20:27:57,220 INFO L226 Difference]: Without dead ends: 1976 [2022-03-15 20:27:57,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 20:27:57,220 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 397 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:27:57,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 259 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2848 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-03-15 20:27:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2022-03-15 20:27:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1436. [2022-03-15 20:27:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1423 states have (on average 1.949402670414617) internal successors, (2774), 1435 states have internal predecessors, (2774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2774 transitions. [2022-03-15 20:27:57,235 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2774 transitions. Word has length 42 [2022-03-15 20:27:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:27:57,235 INFO L470 AbstractCegarLoop]: Abstraction has 1436 states and 2774 transitions. [2022-03-15 20:27:57,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:27:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2774 transitions. [2022-03-15 20:27:57,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:27:57,236 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:27:57,236 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:27:57,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-03-15 20:27:57,236 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:27:57,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:27:57,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1618093974, now seen corresponding path program 16 times [2022-03-15 20:27:57,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:27:57,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424031108] [2022-03-15 20:27:57,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:27:57,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:27:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:27:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:27:58,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:27:58,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424031108] [2022-03-15 20:27:58,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424031108] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:27:58,011 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:27:58,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 20:27:58,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102929876] [2022-03-15 20:27:58,011 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:27:58,015 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:27:58,039 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 84 transitions. [2022-03-15 20:27:58,039 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:27:58,420 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:58,421 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 237 [2022-03-15 20:27:58,442 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:58,443 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:58,533 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:58,534 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 185 [2022-03-15 20:27:58,555 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:58,555 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:58,619 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:58,620 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2022-03-15 20:27:58,634 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:58,634 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:58,749 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:58,749 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:58,752 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:58,753 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2022-03-15 20:27:58,792 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:58,792 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:27:58,794 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:27:58,794 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:27:59,461 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [339868#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 339861#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 339865#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 339863#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|))) (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 339864#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 339866#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 339862#(and (or (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 339869#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1)), 339867#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 339870#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem50#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0)), 339860#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:27:59,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 20:27:59,462 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:27:59,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 20:27:59,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:27:59,462 INFO L87 Difference]: Start difference. First operand 1436 states and 2774 transitions. Second operand has 26 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:06,041 INFO L93 Difference]: Finished difference Result 2032 states and 3927 transitions. [2022-03-15 20:28:06,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 20:28:06,041 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:28:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:06,044 INFO L225 Difference]: With dead ends: 2032 [2022-03-15 20:28:06,044 INFO L226 Difference]: Without dead ends: 2032 [2022-03-15 20:28:06,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=395, Invalid=1585, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 20:28:06,044 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 443 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 2574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:06,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 235 Invalid, 2574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-03-15 20:28:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2022-03-15 20:28:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1431. [2022-03-15 20:28:06,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1418 states have (on average 1.9492242595204514) internal successors, (2764), 1430 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2764 transitions. [2022-03-15 20:28:06,057 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2764 transitions. Word has length 42 [2022-03-15 20:28:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:06,057 INFO L470 AbstractCegarLoop]: Abstraction has 1431 states and 2764 transitions. [2022-03-15 20:28:06,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2764 transitions. [2022-03-15 20:28:06,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:28:06,058 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:06,058 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:28:06,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-03-15 20:28:06,058 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:06,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:06,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1182217982, now seen corresponding path program 17 times [2022-03-15 20:28:06,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:06,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67146864] [2022-03-15 20:28:06,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:06,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:06,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:06,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67146864] [2022-03-15 20:28:06,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67146864] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:06,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:06,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 20:28:06,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [249693698] [2022-03-15 20:28:06,702 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:06,706 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:06,728 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 84 transitions. [2022-03-15 20:28:06,728 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:07,078 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:07,079 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 184 [2022-03-15 20:28:07,097 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:07,097 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:07,167 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:07,167 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:07,171 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:07,171 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 143 [2022-03-15 20:28:07,224 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:07,225 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2022-03-15 20:28:07,236 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:07,237 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:07,276 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:07,277 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:07,280 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:07,280 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2022-03-15 20:28:07,304 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:07,304 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:07,307 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:07,307 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:07,992 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [344822#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) 4) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 344821#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)))), 344824#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) 4) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 344827#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 4) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1))), 344819#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 344826#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))), 344823#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) 4) 0) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 344820#(and (or (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)))), 344825#(and (or (= (select |#valid| |ULTIMATE.start_main_#t~mem49#1.base|) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) 4) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4))) 1) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0))) (or (= |ULTIMATE.start_main_#t~mem49#1.offset| 0) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)))), 344818#(and (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |ULTIMATE.start_main_#t~mem49#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4) 4)) (or (not (= (select (select |#race| |~#slot~0.base|) (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ 2 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem49#1.base|) (+ |ULTIMATE.start_main_#t~mem49#1.offset| 4)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (select (select |#race| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) 1 |~#slot~0.offset|)) 0))))] [2022-03-15 20:28:07,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 20:28:07,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:07,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 20:28:07,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:28:07,993 INFO L87 Difference]: Start difference. First operand 1431 states and 2764 transitions. Second operand has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:15,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:15,148 INFO L93 Difference]: Finished difference Result 2397 states and 4604 transitions. [2022-03-15 20:28:15,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 20:28:15,148 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:28:15,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:15,151 INFO L225 Difference]: With dead ends: 2397 [2022-03-15 20:28:15,151 INFO L226 Difference]: Without dead ends: 2397 [2022-03-15 20:28:15,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=446, Invalid=1810, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 20:28:15,152 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 549 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 2777 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:15,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 439 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2777 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-03-15 20:28:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2022-03-15 20:28:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1426. [2022-03-15 20:28:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1413 states have (on average 1.9490445859872612) internal successors, (2754), 1425 states have internal predecessors, (2754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2754 transitions. [2022-03-15 20:28:15,182 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2754 transitions. Word has length 42 [2022-03-15 20:28:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:15,182 INFO L470 AbstractCegarLoop]: Abstraction has 1426 states and 2754 transitions. [2022-03-15 20:28:15,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2754 transitions. [2022-03-15 20:28:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:28:15,183 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:15,183 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:28:15,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-03-15 20:28:15,183 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2087133082, now seen corresponding path program 18 times [2022-03-15 20:28:15,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:15,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131095543] [2022-03-15 20:28:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:15,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:15,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131095543] [2022-03-15 20:28:15,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131095543] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:15,937 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:15,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:28:15,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1161518699] [2022-03-15 20:28:15,937 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:15,941 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:15,970 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 64 transitions. [2022-03-15 20:28:15,970 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:15,992 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:15,992 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:15,994 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:15,995 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:16,052 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:16,052 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:16,055 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:16,055 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:16,123 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:16,123 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:16,141 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:16,142 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:16,219 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [350137#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))))] [2022-03-15 20:28:16,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:28:16,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:16,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:28:16,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:28:16,219 INFO L87 Difference]: Start difference. First operand 1426 states and 2754 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:20,158 INFO L93 Difference]: Finished difference Result 1527 states and 2931 transitions. [2022-03-15 20:28:20,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:28:20,158 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:28:20,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:20,160 INFO L225 Difference]: With dead ends: 1527 [2022-03-15 20:28:20,160 INFO L226 Difference]: Without dead ends: 1527 [2022-03-15 20:28:20,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:28:20,160 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 255 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:20,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 146 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-03-15 20:28:20,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2022-03-15 20:28:20,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1448. [2022-03-15 20:28:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1435 states have (on average 1.9498257839721254) internal successors, (2798), 1447 states have internal predecessors, (2798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:20,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2798 transitions. [2022-03-15 20:28:20,171 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2798 transitions. Word has length 42 [2022-03-15 20:28:20,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:20,171 INFO L470 AbstractCegarLoop]: Abstraction has 1448 states and 2798 transitions. [2022-03-15 20:28:20,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:20,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2798 transitions. [2022-03-15 20:28:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:28:20,172 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:20,172 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:28:20,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-03-15 20:28:20,172 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash 725571160, now seen corresponding path program 19 times [2022-03-15 20:28:20,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:20,174 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696597363] [2022-03-15 20:28:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:20,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:20,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:20,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696597363] [2022-03-15 20:28:20,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696597363] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:20,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:20,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:28:20,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1057340016] [2022-03-15 20:28:20,928 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:20,953 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:20,972 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 64 transitions. [2022-03-15 20:28:20,972 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:21,007 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:21,007 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:21,020 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:21,021 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:21,044 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:21,044 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:21,046 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:21,047 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:21,129 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:21,130 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:21,132 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:21,132 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:21,231 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [354601#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))] [2022-03-15 20:28:21,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:28:21,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:21,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:28:21,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:28:21,231 INFO L87 Difference]: Start difference. First operand 1448 states and 2798 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:25,382 INFO L93 Difference]: Finished difference Result 1545 states and 2967 transitions. [2022-03-15 20:28:25,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 20:28:25,382 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:28:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:25,384 INFO L225 Difference]: With dead ends: 1545 [2022-03-15 20:28:25,384 INFO L226 Difference]: Without dead ends: 1545 [2022-03-15 20:28:25,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:28:25,384 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 256 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:25,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 133 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 20:28:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2022-03-15 20:28:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1458. [2022-03-15 20:28:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1445 states have (on average 1.9501730103806227) internal successors, (2818), 1457 states have internal predecessors, (2818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2818 transitions. [2022-03-15 20:28:25,395 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2818 transitions. Word has length 42 [2022-03-15 20:28:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:25,395 INFO L470 AbstractCegarLoop]: Abstraction has 1458 states and 2818 transitions. [2022-03-15 20:28:25,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2818 transitions. [2022-03-15 20:28:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:28:25,396 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:25,396 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:28:25,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-03-15 20:28:25,396 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:25,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:25,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1953777494, now seen corresponding path program 20 times [2022-03-15 20:28:25,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:25,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930227031] [2022-03-15 20:28:25,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:25,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:26,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:26,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930227031] [2022-03-15 20:28:26,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930227031] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:26,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:26,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 20:28:26,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [677674304] [2022-03-15 20:28:26,187 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:26,192 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:26,210 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 66 transitions. [2022-03-15 20:28:26,210 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:26,228 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:26,228 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:26,231 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:26,231 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:26,277 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:26,278 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:26,281 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:26,281 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:26,336 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:26,336 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:26,339 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:26,339 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:26,461 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [359105#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))))) 1) (= (select |#valid| 3) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) 1) (= 3 |~#slot~0.base|)), 359104#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))))] [2022-03-15 20:28:26,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:28:26,462 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:26,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:28:26,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:28:26,462 INFO L87 Difference]: Start difference. First operand 1458 states and 2818 transitions. Second operand has 17 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:31,326 INFO L93 Difference]: Finished difference Result 1564 states and 3003 transitions. [2022-03-15 20:28:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 20:28:31,327 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:28:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:31,328 INFO L225 Difference]: With dead ends: 1564 [2022-03-15 20:28:31,328 INFO L226 Difference]: Without dead ends: 1564 [2022-03-15 20:28:31,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=784, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:28:31,329 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 259 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:31,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 146 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-03-15 20:28:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2022-03-15 20:28:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1460. [2022-03-15 20:28:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1447 states have (on average 1.9502418797512093) internal successors, (2822), 1459 states have internal predecessors, (2822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2822 transitions. [2022-03-15 20:28:31,340 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2822 transitions. Word has length 42 [2022-03-15 20:28:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:31,340 INFO L470 AbstractCegarLoop]: Abstraction has 1460 states and 2822 transitions. [2022-03-15 20:28:31,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2822 transitions. [2022-03-15 20:28:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:28:31,341 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:31,341 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:28:31,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-03-15 20:28:31,341 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:31,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash -760859098, now seen corresponding path program 21 times [2022-03-15 20:28:31,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:31,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246678377] [2022-03-15 20:28:31,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:31,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:32,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:32,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246678377] [2022-03-15 20:28:32,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246678377] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:32,094 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:32,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:28:32,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [77028385] [2022-03-15 20:28:32,095 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:32,102 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:32,120 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 64 transitions. [2022-03-15 20:28:32,120 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:32,154 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:32,155 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:32,157 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:32,157 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:32,179 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:32,180 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:32,182 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:32,182 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:32,283 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:32,284 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:32,286 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:32,286 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:32,421 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [363636#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))] [2022-03-15 20:28:32,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:28:32,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:32,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:28:32,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:28:32,422 INFO L87 Difference]: Start difference. First operand 1460 states and 2822 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:37,152 INFO L93 Difference]: Finished difference Result 1587 states and 3051 transitions. [2022-03-15 20:28:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:28:37,152 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:28:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:37,154 INFO L225 Difference]: With dead ends: 1587 [2022-03-15 20:28:37,154 INFO L226 Difference]: Without dead ends: 1587 [2022-03-15 20:28:37,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:28:37,154 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 248 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:37,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 146 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-03-15 20:28:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2022-03-15 20:28:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1480. [2022-03-15 20:28:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1467 states have (on average 1.950920245398773) internal successors, (2862), 1479 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2862 transitions. [2022-03-15 20:28:37,165 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2862 transitions. Word has length 42 [2022-03-15 20:28:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:37,166 INFO L470 AbstractCegarLoop]: Abstraction has 1480 states and 2862 transitions. [2022-03-15 20:28:37,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2862 transitions. [2022-03-15 20:28:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:28:37,167 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:37,167 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:28:37,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-03-15 20:28:37,167 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:37,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:37,167 INFO L85 PathProgramCache]: Analyzing trace with hash 467347236, now seen corresponding path program 22 times [2022-03-15 20:28:37,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:37,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999189714] [2022-03-15 20:28:37,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:37,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:38,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:38,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999189714] [2022-03-15 20:28:38,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999189714] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:38,227 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:38,227 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:28:38,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [40670499] [2022-03-15 20:28:38,227 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:38,231 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:38,250 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 66 transitions. [2022-03-15 20:28:38,250 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:38,277 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:38,277 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:38,280 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:38,280 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:38,323 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:38,323 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:38,325 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:38,326 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:38,369 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:38,370 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:38,379 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:38,379 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:38,603 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [368224#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))) (= 3 |~#slot~0.base|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0))] [2022-03-15 20:28:38,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:28:38,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:38,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:28:38,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:28:38,603 INFO L87 Difference]: Start difference. First operand 1480 states and 2862 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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-15 20:28:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:43,563 INFO L93 Difference]: Finished difference Result 1611 states and 3097 transitions. [2022-03-15 20:28:43,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:28:43,563 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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 42 [2022-03-15 20:28:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:43,565 INFO L225 Difference]: With dead ends: 1611 [2022-03-15 20:28:43,565 INFO L226 Difference]: Without dead ends: 1611 [2022-03-15 20:28:43,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:28:43,565 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 256 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:43,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 133 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-03-15 20:28:43,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-03-15 20:28:43,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1470. [2022-03-15 20:28:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1457 states have (on average 1.9505833905284833) internal successors, (2842), 1469 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 2842 transitions. [2022-03-15 20:28:43,579 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 2842 transitions. Word has length 42 [2022-03-15 20:28:43,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:43,580 INFO L470 AbstractCegarLoop]: Abstraction has 1470 states and 2842 transitions. [2022-03-15 20:28:43,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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-15 20:28:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 2842 transitions. [2022-03-15 20:28:43,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:28:43,581 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:43,581 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:28:43,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-03-15 20:28:43,581 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:43,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:43,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1921340058, now seen corresponding path program 23 times [2022-03-15 20:28:43,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:43,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37487517] [2022-03-15 20:28:43,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:43,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:44,185 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:44,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:44,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37487517] [2022-03-15 20:28:44,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37487517] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:44,186 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:44,186 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 20:28:44,186 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1658827080] [2022-03-15 20:28:44,186 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:44,190 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:44,209 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 68 transitions. [2022-03-15 20:28:44,209 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:44,242 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:44,242 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:44,244 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:44,245 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:44,259 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:44,259 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:44,262 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:44,263 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:44,277 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:44,277 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:44,280 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:44,280 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:44,446 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [372821#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))))] [2022-03-15 20:28:44,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:28:44,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:44,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:28:44,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:28:44,447 INFO L87 Difference]: Start difference. First operand 1470 states and 2842 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:49,007 INFO L93 Difference]: Finished difference Result 1628 states and 3127 transitions. [2022-03-15 20:28:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:28:49,007 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:28:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:49,009 INFO L225 Difference]: With dead ends: 1628 [2022-03-15 20:28:49,009 INFO L226 Difference]: Without dead ends: 1628 [2022-03-15 20:28:49,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:28:49,009 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 257 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:49,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 146 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 20:28:49,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2022-03-15 20:28:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1472. [2022-03-15 20:28:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 1459 states have (on average 1.9506511309115833) internal successors, (2846), 1471 states have internal predecessors, (2846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2846 transitions. [2022-03-15 20:28:49,020 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2846 transitions. Word has length 42 [2022-03-15 20:28:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:49,020 INFO L470 AbstractCegarLoop]: Abstraction has 1472 states and 2846 transitions. [2022-03-15 20:28:49,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2846 transitions. [2022-03-15 20:28:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:28:49,021 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:49,022 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:28:49,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-03-15 20:28:49,022 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash 95398040, now seen corresponding path program 24 times [2022-03-15 20:28:49,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:49,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481419902] [2022-03-15 20:28:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:49,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:50,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:50,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481419902] [2022-03-15 20:28:50,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481419902] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:50,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:50,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:28:50,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1580597710] [2022-03-15 20:28:50,059 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:50,063 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:50,082 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 64 transitions. [2022-03-15 20:28:50,082 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:50,108 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:50,108 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:50,111 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:50,111 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:50,166 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:50,167 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:50,187 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:50,187 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:50,314 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:50,315 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:50,318 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:50,318 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:50,444 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [377440#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 1)) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= 4 (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))] [2022-03-15 20:28:50,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:28:50,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:50,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:28:50,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:28:50,445 INFO L87 Difference]: Start difference. First operand 1472 states and 2846 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:55,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:28:55,048 INFO L93 Difference]: Finished difference Result 1623 states and 3123 transitions. [2022-03-15 20:28:55,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:28:55,048 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:28:55,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:28:55,050 INFO L225 Difference]: With dead ends: 1623 [2022-03-15 20:28:55,050 INFO L226 Difference]: Without dead ends: 1623 [2022-03-15 20:28:55,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:28:55,051 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 247 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:28:55,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 133 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-03-15 20:28:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2022-03-15 20:28:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1502. [2022-03-15 20:28:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1489 states have (on average 1.951645399597045) internal successors, (2906), 1501 states have internal predecessors, (2906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2906 transitions. [2022-03-15 20:28:55,063 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2906 transitions. Word has length 42 [2022-03-15 20:28:55,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:28:55,063 INFO L470 AbstractCegarLoop]: Abstraction has 1502 states and 2906 transitions. [2022-03-15 20:28:55,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:28:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2906 transitions. [2022-03-15 20:28:55,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:28:55,064 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:28:55,064 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:28:55,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-03-15 20:28:55,064 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:28:55,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:28:55,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1323604374, now seen corresponding path program 25 times [2022-03-15 20:28:55,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:28:55,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677507595] [2022-03-15 20:28:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:28:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:28:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:28:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:28:55,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:28:55,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677507595] [2022-03-15 20:28:55,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677507595] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:28:55,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:28:55,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:28:55,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1191352822] [2022-03-15 20:28:55,789 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:28:55,793 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:28:55,846 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 66 transitions. [2022-03-15 20:28:55,846 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:28:55,927 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:55,928 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:55,930 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:55,931 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:55,952 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:55,953 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:55,955 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:55,956 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:55,981 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:55,982 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:28:55,984 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:28:55,985 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:28:56,137 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [382106#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))))] [2022-03-15 20:28:56,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:28:56,137 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:28:56,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:28:56,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:28:56,138 INFO L87 Difference]: Start difference. First operand 1502 states and 2906 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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-15 20:29:00,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:00,920 INFO L93 Difference]: Finished difference Result 1647 states and 3169 transitions. [2022-03-15 20:29:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:29:00,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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 42 [2022-03-15 20:29:00,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:00,923 INFO L225 Difference]: With dead ends: 1647 [2022-03-15 20:29:00,923 INFO L226 Difference]: Without dead ends: 1647 [2022-03-15 20:29:00,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:29:00,923 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 252 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:00,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 146 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-03-15 20:29:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2022-03-15 20:29:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1492. [2022-03-15 20:29:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1479 states have (on average 1.9513184584178498) internal successors, (2886), 1491 states have internal predecessors, (2886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:29:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2886 transitions. [2022-03-15 20:29:00,950 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2886 transitions. Word has length 42 [2022-03-15 20:29:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:00,950 INFO L470 AbstractCegarLoop]: Abstraction has 1492 states and 2886 transitions. [2022-03-15 20:29:00,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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-15 20:29:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2886 transitions. [2022-03-15 20:29:00,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:29:00,951 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:00,951 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:29:00,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-03-15 20:29:00,951 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:29:00,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:00,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1065082920, now seen corresponding path program 26 times [2022-03-15 20:29:00,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:00,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780359893] [2022-03-15 20:29:00,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:29:02,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:02,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780359893] [2022-03-15 20:29:02,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780359893] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:02,606 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:02,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:29:02,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1357837531] [2022-03-15 20:29:02,607 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:02,611 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:02,630 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 68 transitions. [2022-03-15 20:29:02,630 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:02,656 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:02,657 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:02,659 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:02,660 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:29:02,728 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:02,729 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:02,731 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:02,731 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:29:02,803 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:02,803 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:29:02,806 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:02,806 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:02,969 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [386784#(and (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (not (= (+ 3 (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|) (+ |t_funThread1of1ForFork0_new_~p~0#1.offset| 4))) (= 3 |~#slot~0.base|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))) (= |t_funThread1of1ForFork0_new_~p~0#1.offset| 0))] [2022-03-15 20:29:02,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:29:02,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:02,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:29:02,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:29:02,970 INFO L87 Difference]: Start difference. First operand 1492 states and 2886 transitions. Second operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:29:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:29:07,368 INFO L93 Difference]: Finished difference Result 1847 states and 3587 transitions. [2022-03-15 20:29:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 20:29:07,369 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-03-15 20:29:07,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:29:07,371 INFO L225 Difference]: With dead ends: 1847 [2022-03-15 20:29:07,371 INFO L226 Difference]: Without dead ends: 1847 [2022-03-15 20:29:07,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:29:07,371 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 213 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:07,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 173 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 20:29:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2022-03-15 20:29:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1502. [2022-03-15 20:29:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1489 states have (on average 1.951645399597045) internal successors, (2906), 1501 states have internal predecessors, (2906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:29:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2906 transitions. [2022-03-15 20:29:07,396 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2906 transitions. Word has length 42 [2022-03-15 20:29:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:29:07,397 INFO L470 AbstractCegarLoop]: Abstraction has 1502 states and 2906 transitions. [2022-03-15 20:29:07,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:29:07,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2906 transitions. [2022-03-15 20:29:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:29:07,398 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:29:07,398 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-03-15 20:29:07,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-03-15 20:29:07,398 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:29:07,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:29:07,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1969879638, now seen corresponding path program 27 times [2022-03-15 20:29:07,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:29:07,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547108050] [2022-03-15 20:29:07,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:29:07,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:29:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:29:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:29:08,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:29:08,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547108050] [2022-03-15 20:29:08,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547108050] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:29:08,144 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:29:08,144 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:29:08,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [829542655] [2022-03-15 20:29:08,144 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:29:08,149 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:29:08,213 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 70 transitions. [2022-03-15 20:29:08,213 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:29:08,233 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:08,233 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:08,235 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:08,235 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:29:08,259 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:08,260 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:29:08,262 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:08,262 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:08,342 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:08,342 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-03-15 20:29:08,344 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:29:08,344 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:29:08,442 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [391678#(and (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| |~#slot~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)) |t_funThread1of1ForFork0_new_~p~0#1.base|)) (= 3 |~#slot~0.base|) (not (= |t_funThread1of1ForFork0_new_~p~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|))) (+ 4 (select (select |#memory_$Pointer$.offset| |~#slot~0.base|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |~#slot~0.offset|)))))))] [2022-03-15 20:29:08,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:29:08,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:29:08,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:29:08,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:29:08,443 INFO L87 Difference]: Start difference. First operand 1502 states and 2906 transitions. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 20:29:09,950 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-15 20:29:11,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:29:11,077 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:29:11,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 20:29:11,078 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2022-03-15 20:29:11,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-03-15 20:29:11,078 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-03-15 20:29:11,079 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2022-03-15 20:29:11,079 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2022-03-15 20:29:11,079 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (11 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2022-03-15 20:29:11,080 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2022-03-15 20:29:11,082 INFO L732 BasicCegarLoop]: Path program histogram: [27, 14, 6, 6, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:29:11,084 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:29:11,084 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:29:11,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:29:11 BasicIcfg [2022-03-15 20:29:11,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:29:11,085 INFO L158 Benchmark]: Toolchain (without parser) took 852999.24ms. Allocated memory was 191.9MB in the beginning and 1.0GB in the end (delta: 854.6MB). Free memory was 137.7MB in the beginning and 521.4MB in the end (delta: -383.6MB). Peak memory consumption was 470.7MB. Max. memory is 8.0GB. [2022-03-15 20:29:11,085 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory is still 157.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:29:11,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.20ms. Allocated memory was 191.9MB in the beginning and 234.9MB in the end (delta: 43.0MB). Free memory was 137.5MB in the beginning and 181.8MB in the end (delta: -44.3MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-03-15 20:29:11,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.17ms. Allocated memory is still 234.9MB. Free memory was 181.8MB in the beginning and 177.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-03-15 20:29:11,085 INFO L158 Benchmark]: Boogie Preprocessor took 52.27ms. Allocated memory is still 234.9MB. Free memory was 177.6MB in the beginning and 174.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 20:29:11,085 INFO L158 Benchmark]: RCFGBuilder took 504.01ms. Allocated memory is still 234.9MB. Free memory was 174.5MB in the beginning and 146.2MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-03-15 20:29:11,085 INFO L158 Benchmark]: TraceAbstraction took 851858.86ms. Allocated memory was 234.9MB in the beginning and 1.0GB in the end (delta: 811.6MB). Free memory was 145.6MB in the beginning and 521.4MB in the end (delta: -375.7MB). Peak memory consumption was 436.9MB. Max. memory is 8.0GB. [2022-03-15 20:29:11,086 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.09ms. Allocated memory is still 191.9MB. Free memory is still 157.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 533.20ms. Allocated memory was 191.9MB in the beginning and 234.9MB in the end (delta: 43.0MB). Free memory was 137.5MB in the beginning and 181.8MB in the end (delta: -44.3MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.17ms. Allocated memory is still 234.9MB. Free memory was 181.8MB in the beginning and 177.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.27ms. Allocated memory is still 234.9MB. Free memory was 177.6MB in the beginning and 174.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 504.01ms. Allocated memory is still 234.9MB. Free memory was 174.5MB in the beginning and 146.2MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 851858.86ms. Allocated memory was 234.9MB in the beginning and 1.0GB in the end (delta: 811.6MB). Free memory was 145.6MB in the beginning and 521.4MB in the end (delta: -375.7MB). Peak memory consumption was 436.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 441.3s, 280 PlacesBefore, 84 PlacesAfterwards, 280 TransitionsBefore, 81 TransitionsAfterwards, 6512 CoEnabledTransitionPairs, 9 FixpointIterations, 186 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 259 TotalNumberOfCompositions, 45212 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6788, positive: 5554, positive conditional: 0, positive unconditional: 5554, negative: 1234, negative conditional: 0, negative unconditional: 1234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2738, positive: 2612, positive conditional: 0, positive unconditional: 2612, negative: 126, negative conditional: 0, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6788, positive: 2942, positive conditional: 0, positive unconditional: 2942, negative: 1108, negative conditional: 0, negative unconditional: 1108, unknown: 2738, unknown conditional: 0, unknown unconditional: 2738] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 202, Positive conditional cache size: 0, Positive unconditional cache size: 202, Negative cache size: 97, Negative conditional cache size: 0, Negative unconditional cache size: 97 - 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: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1260]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1264]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1264]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1265]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1262]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1249]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 366 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 851.7s, OverallIterations: 82, TraceHistogramMax: 10, PathProgramHistogramMax: 27, EmptinessCheckTime: 0.1s, AutomataDifference: 302.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 441.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 22536 SdHoareTripleChecker+Valid, 274.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22536 mSDsluCounter, 15241 SdHoareTripleChecker+Invalid, 261.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1053 IncrementalHoareTripleChecker+Unchecked, 20437 mSDsCounter, 6568 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119025 IncrementalHoareTripleChecker+Invalid, 126648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6568 mSolverCounterUnsat, 3678 mSDtfsCounter, 119025 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3479 GetRequests, 1044 SyntacticMatches, 138 SemanticMatches, 2297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20652 ImplicationChecksByTransitivity, 46.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1785occurred in iteration=37, InterpolantAutomatonStates: 1592, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 81 MinimizatonAttempts, 35195 StatesRemovedByMinimization, 66 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 23.6s SatisfiabilityAnalysisTime, 24.8s InterpolantComputationTime, 2961 NumberOfCodeBlocks, 2922 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 3018 ConstructedInterpolants, 50 QuantifiedInterpolants, 51872 SizeOfPredicates, 60 NumberOfNonLiveVariables, 20909 ConjunctsInSsa, 404 ConjunctsInUnsatCore, 107 InterpolantComputations, 73 PerfectInterpolantSequences, 3616/4256 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