/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/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -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/pthread/stack_longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-10 03:18:45,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-10 03:18:45,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-10 03:18:45,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-10 03:18:45,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-10 03:18:45,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-10 03:18:45,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-10 03:18:45,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-10 03:18:45,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-10 03:18:45,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-10 03:18:45,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-10 03:18:45,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-10 03:18:45,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-10 03:18:45,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-10 03:18:45,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-10 03:18:45,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-10 03:18:45,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-10 03:18:45,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-10 03:18:45,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-10 03:18:45,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-10 03:18:45,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-10 03:18:45,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-10 03:18:45,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-10 03:18:45,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-10 03:18:45,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-10 03:18:45,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-10 03:18:45,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-10 03:18:45,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-10 03:18:45,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-10 03:18:45,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-10 03:18:45,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-10 03:18:45,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-10 03:18:45,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-10 03:18:45,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-10 03:18:45,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-10 03:18:45,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-10 03:18:45,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-10 03:18:45,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-10 03:18:45,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-10 03:18:45,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-10 03:18:45,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-10 03:18:45,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-10 03:18:45,102 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-10 03:18:45,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-10 03:18:45,102 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-10 03:18:45,102 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-10 03:18:45,103 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-10 03:18:45,103 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-10 03:18:45,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-10 03:18:45,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-10 03:18:45,104 INFO L138 SettingsManager]: * Use SBE=true [2022-11-10 03:18:45,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-10 03:18:45,104 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-10 03:18:45,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-10 03:18:45,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-10 03:18:45,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-10 03:18:45,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-10 03:18:45,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-10 03:18:45,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-10 03:18:45,105 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-10 03:18:45,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-10 03:18:45,105 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-10 03:18:45,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-10 03:18:45,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-10 03:18:45,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-10 03:18:45,106 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-10 03:18:45,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-10 03:18:45,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 03:18:45,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-10 03:18:45,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-10 03:18:45,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-10 03:18:45,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-10 03:18:45,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-10 03:18:45,107 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-10 03:18:45,107 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-10 03:18:45,107 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-10 03:18:45,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-10 03:18:45,108 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-10 03:18:45,108 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-10 03:18:45,108 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-10 03:18:45,108 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC 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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION 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-11-10 03:18:45,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-10 03:18:45,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-10 03:18:45,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-10 03:18:45,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-10 03:18:45,349 INFO L275 PluginConnector]: CDTParser initialized [2022-11-10 03:18:45,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-1.i [2022-11-10 03:18:45,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/039bb4342/658d4f294ac14db7b4d672eab9c1cf5f/FLAG273813bf4 [2022-11-10 03:18:45,813 INFO L306 CDTParser]: Found 1 translation units. [2022-11-10 03:18:45,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i [2022-11-10 03:18:45,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/039bb4342/658d4f294ac14db7b4d672eab9c1cf5f/FLAG273813bf4 [2022-11-10 03:18:46,173 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/039bb4342/658d4f294ac14db7b4d672eab9c1cf5f [2022-11-10 03:18:46,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-10 03:18:46,177 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-10 03:18:46,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-10 03:18:46,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-10 03:18:46,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-10 03:18:46,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:18:46" (1/1) ... [2022-11-10 03:18:46,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75012467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:46, skipping insertion in model container [2022-11-10 03:18:46,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:18:46" (1/1) ... [2022-11-10 03:18:46,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-10 03:18:46,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-10 03:18:46,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i[41527,41540] [2022-11-10 03:18:46,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 03:18:46,592 INFO L203 MainTranslator]: Completed pre-run [2022-11-10 03:18:46,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i[41527,41540] [2022-11-10 03:18:46,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 03:18:46,699 INFO L208 MainTranslator]: Completed translation [2022-11-10 03:18:46,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:46 WrapperNode [2022-11-10 03:18:46,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-10 03:18:46,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-10 03:18:46,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-10 03:18:46,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-10 03:18:46,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:46" (1/1) ... [2022-11-10 03:18:46,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:46" (1/1) ... [2022-11-10 03:18:46,765 INFO L138 Inliner]: procedures = 277, calls = 41, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 205 [2022-11-10 03:18:46,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-10 03:18:46,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-10 03:18:46,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-10 03:18:46,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-10 03:18:46,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:46" (1/1) ... [2022-11-10 03:18:46,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:46" (1/1) ... [2022-11-10 03:18:46,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:46" (1/1) ... [2022-11-10 03:18:46,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:46" (1/1) ... [2022-11-10 03:18:46,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:46" (1/1) ... [2022-11-10 03:18:46,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:46" (1/1) ... [2022-11-10 03:18:46,811 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:46" (1/1) ... [2022-11-10 03:18:46,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:46" (1/1) ... [2022-11-10 03:18:46,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-10 03:18:46,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-10 03:18:46,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-10 03:18:46,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-10 03:18:46,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:46" (1/1) ... [2022-11-10 03:18:46,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 03:18:46,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:18:46,851 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-11-10 03:18:46,864 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-11-10 03:18:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-10 03:18:46,909 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-10 03:18:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-10 03:18:46,909 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-10 03:18:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-10 03:18:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-10 03:18:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-10 03:18:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-10 03:18:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-10 03:18:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-10 03:18:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-10 03:18:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-10 03:18:46,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-10 03:18:46,911 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-10 03:18:47,001 INFO L235 CfgBuilder]: Building ICFG [2022-11-10 03:18:47,003 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-10 03:18:47,338 INFO L276 CfgBuilder]: Performing block encoding [2022-11-10 03:18:47,345 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-10 03:18:47,345 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-10 03:18:47,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:18:47 BoogieIcfgContainer [2022-11-10 03:18:47,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-10 03:18:47,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-10 03:18:47,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-10 03:18:47,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-10 03:18:47,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:18:46" (1/3) ... [2022-11-10 03:18:47,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5780070f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:18:47, skipping insertion in model container [2022-11-10 03:18:47,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:46" (2/3) ... [2022-11-10 03:18:47,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5780070f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:18:47, skipping insertion in model container [2022-11-10 03:18:47,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:18:47" (3/3) ... [2022-11-10 03:18:47,357 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2022-11-10 03:18:47,362 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-10 03:18:47,368 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-10 03:18:47,368 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-10 03:18:47,368 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-10 03:18:47,453 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-10 03:18:47,497 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 03:18:47,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 03:18:47,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:18:47,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 03:18:47,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-10 03:18:47,533 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 03:18:47,542 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 03:18:47,546 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18b8402f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 03:18:47,547 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 03:18:47,836 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:47,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:47,840 INFO L85 PathProgramCache]: Analyzing trace with hash -583222985, now seen corresponding path program 1 times [2022-11-10 03:18:47,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:47,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841454718] [2022-11-10 03:18:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:47,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:18:48,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:48,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841454718] [2022-11-10 03:18:48,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841454718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:18:48,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:18:48,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 03:18:48,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393869733] [2022-11-10 03:18:48,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:18:48,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 03:18:48,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:18:48,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 03:18:48,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 03:18:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:48,864 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:18:48,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:18:48,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:49,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:49,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-10 03:18:49,183 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash 967249229, now seen corresponding path program 1 times [2022-11-10 03:18:49,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:49,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728724688] [2022-11-10 03:18:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-10 03:18:49,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:49,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728724688] [2022-11-10 03:18:49,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728724688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:18:49,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:18:49,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 03:18:49,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411882352] [2022-11-10 03:18:49,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:18:49,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 03:18:49,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:18:49,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 03:18:49,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 03:18:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:49,339 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:18:49,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:18:49,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:49,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:49,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:49,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:18:49,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-10 03:18:49,434 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:49,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:49,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1356954178, now seen corresponding path program 1 times [2022-11-10 03:18:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:49,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593348473] [2022-11-10 03:18:49,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:49,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:18:50,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:50,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593348473] [2022-11-10 03:18:50,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593348473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:18:50,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:18:50,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-10 03:18:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604588533] [2022-11-10 03:18:50,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:18:50,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-10 03:18:50,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:18:50,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-10 03:18:50,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-10 03:18:50,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:50,570 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:18:50,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:18:50,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:50,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:18:50,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:51,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:51,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:18:51,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:18:51,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-10 03:18:51,358 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:51,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:51,359 INFO L85 PathProgramCache]: Analyzing trace with hash 569185608, now seen corresponding path program 1 times [2022-11-10 03:18:51,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:51,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992472720] [2022-11-10 03:18:51,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 119 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-10 03:18:51,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:51,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992472720] [2022-11-10 03:18:51,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992472720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:18:51,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234677216] [2022-11-10 03:18:51,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:51,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:18:51,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:18:51,501 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-11-10 03:18:51,522 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-11-10 03:18:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:51,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-10 03:18:51,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:18:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-10 03:18:51,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-10 03:18:51,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234677216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:18:51,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-10 03:18:51,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-10 03:18:51,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49593895] [2022-11-10 03:18:51,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:18:51,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 03:18:51,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:18:51,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 03:18:51,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-10 03:18:51,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:51,726 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:18:51,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:18:51,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:51,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:18:51,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:18:51,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:51,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:51,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:18:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:18:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:18:51,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-10 03:18:52,176 WARN L477 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-11-10 03:18:52,177 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:52,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash -580160600, now seen corresponding path program 2 times [2022-11-10 03:18:52,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:52,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408797106] [2022-11-10 03:18:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:52,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 173 proven. 20 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-10 03:18:52,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:52,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408797106] [2022-11-10 03:18:52,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408797106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:18:52,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130120043] [2022-11-10 03:18:52,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 03:18:52,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:18:52,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:18:52,420 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-11-10 03:18:52,448 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-11-10 03:18:52,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-10 03:18:52,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:18:52,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-10 03:18:52,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:18:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 173 proven. 20 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-10 03:18:52,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:18:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 173 proven. 20 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-10 03:18:52,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130120043] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:18:52,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:18:52,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-10 03:18:52,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589864896] [2022-11-10 03:18:52,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:18:52,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-10 03:18:52,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:18:52,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-10 03:18:52,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-10 03:18:52,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:52,886 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:18:52,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 39.8) internal successors, (398), 10 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:18:52,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:52,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:18:52,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:18:52,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:18:52,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:18:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:18:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:18:53,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-10 03:18:53,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-10 03:18:53,273 WARN L477 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-11-10 03:18:53,273 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:53,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:53,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1231078471, now seen corresponding path program 1 times [2022-11-10 03:18:53,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:53,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186247720] [2022-11-10 03:18:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:18:54,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:54,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186247720] [2022-11-10 03:18:54,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186247720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:18:54,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426274809] [2022-11-10 03:18:54,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:54,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:18:54,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:18:54,163 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-11-10 03:18:54,164 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-11-10 03:18:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:54,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-10 03:18:54,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:18:54,366 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:18:54,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 03:18:54,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:18:54,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:54,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:18:54,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:54,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:54,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:18:54,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:54,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:54,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:54,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:18:55,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:55,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:18:55,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:55,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:18:55,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:55,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:18:55,135 INFO L390 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 41 treesize of output 37 [2022-11-10 03:18:55,817 INFO L390 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 41 treesize of output 37 [2022-11-10 03:18:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-10 03:18:55,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:18:55,870 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-10 03:18:56,024 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-10 03:18:56,048 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)))) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-10 03:19:07,115 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-10 03:19:07,275 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:19:07,275 INFO L390 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49 [2022-11-10 03:19:07,282 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:19:07,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34 [2022-11-10 03:19:07,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-10 03:19:07,361 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:19:07,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 03:19:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 18 not checked. [2022-11-10 03:19:07,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426274809] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:19:07,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:19:07,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 34 [2022-11-10 03:19:07,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726063931] [2022-11-10 03:19:07,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:19:07,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-10 03:19:07,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:07,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-10 03:19:07,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=673, Unknown=46, NotChecked=244, Total=1190 [2022-11-10 03:19:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:07,368 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:07,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 11.029411764705882) internal successors, (375), 35 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:19:07,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:07,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:07,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:07,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:07,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-10 03:19:07,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:10,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:10,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:10,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:10,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:10,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-10 03:19:10,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:19:10,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-10 03:19:10,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:19:10,647 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash -36954902, now seen corresponding path program 2 times [2022-11-10 03:19:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:10,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012361592] [2022-11-10 03:19:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:10,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:11,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:11,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012361592] [2022-11-10 03:19:11,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012361592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:19:11,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:19:11,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-10 03:19:11,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972369931] [2022-11-10 03:19:11,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:19:11,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-10 03:19:11,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:11,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-10 03:19:11,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-10 03:19:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:11,455 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:11,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:19:11,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:11,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:11,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:11,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:11,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-10 03:19:11,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:19:11,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:14,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-10 03:19:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:19:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:19:14,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-10 03:19:14,449 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:14,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:14,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1778217701, now seen corresponding path program 2 times [2022-11-10 03:19:14,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:14,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588996432] [2022-11-10 03:19:14,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:14,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:15,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:15,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588996432] [2022-11-10 03:19:15,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588996432] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:19:15,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062568457] [2022-11-10 03:19:15,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 03:19:15,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:19:15,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:19:15,256 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-11-10 03:19:15,257 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-11-10 03:19:15,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-10 03:19:15,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:19:15,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-10 03:19:15,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:19:15,446 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-10 03:19:15,446 INFO L390 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-11-10 03:19:15,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:19:15,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:15,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:19:15,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:15,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:15,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:19:16,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:16,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:19:16,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:16,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:16,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:16,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:19:16,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:16,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:19:16,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:16,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:19:16,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:19:17,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:19:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:17,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:19:17,916 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-10 03:19:18,214 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-10 03:19:18,861 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1))) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))))) is different from false [2022-11-10 03:19:18,882 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_484))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_484))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_484))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_484))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-10 03:19:19,080 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_484))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_484))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_484))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_484))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)))) is different from false [2022-11-10 03:19:19,124 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_484))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_484))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_484))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_~#arr~0.base| v_ArrVal_484))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)))) is different from false [2022-11-10 03:19:19,323 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) (.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse0 (store .cse2 |c_~#arr~0.base| v_ArrVal_484))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse4 (store .cse2 |c_~#arr~0.base| v_ArrVal_484))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse5 (store .cse2 |c_~#arr~0.base| v_ArrVal_484))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse6 (store .cse2 |c_~#arr~0.base| v_ArrVal_484))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-10 03:19:19,424 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:19:19,425 INFO L390 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2022-11-10 03:19:19,433 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:19:19,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 60 [2022-11-10 03:19:19,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-10 03:19:19,541 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-10 03:19:19,541 INFO L390 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 19 treesize of output 19 [2022-11-10 03:19:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-10 03:19:19,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062568457] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:19:19,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:19:19,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 16] total 41 [2022-11-10 03:19:19,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253046269] [2022-11-10 03:19:19,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:19:19,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-10 03:19:19,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:19,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-10 03:19:19,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=889, Unknown=61, NotChecked=504, Total=1722 [2022-11-10 03:19:19,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:19,566 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:19,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 10.048780487804878) internal successors, (412), 42 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:19:19,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:19,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:19,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:19,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:19,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-10 03:19:19,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:19:19,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:19:19,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:29,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:29,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-10 03:19:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:19:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-10 03:19:29,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-10 03:19:29,799 WARN L477 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-11-10 03:19:29,800 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:29,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:29,800 INFO L85 PathProgramCache]: Analyzing trace with hash 879012232, now seen corresponding path program 3 times [2022-11-10 03:19:29,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:29,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103121353] [2022-11-10 03:19:29,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:29,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:30,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:30,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103121353] [2022-11-10 03:19:30,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103121353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:19:30,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:19:30,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-10 03:19:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928810058] [2022-11-10 03:19:30,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:19:30,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-10 03:19:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:30,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-10 03:19:30,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-10 03:19:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:30,410 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:30,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:19:30,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:30,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:30,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:30,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:30,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-10 03:19:30,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:30,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:19:30,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-10 03:19:30,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-10 03:19:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:19:39,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-10 03:19:39,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:19:39,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-10 03:19:39,351 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:39,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1839067261, now seen corresponding path program 3 times [2022-11-10 03:19:39,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:39,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052357227] [2022-11-10 03:19:39,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:39,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:40,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:40,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052357227] [2022-11-10 03:19:40,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052357227] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:19:40,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629867249] [2022-11-10 03:19:40,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-10 03:19:40,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:19:40,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:19:40,272 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-11-10 03:19:40,307 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-11-10 03:19:40,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-10 03:19:40,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:19:40,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-10 03:19:40,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:19:40,491 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:19:40,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 03:19:40,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:19:40,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:40,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:19:41,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:41,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-10 03:19:41,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:41,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:41,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:19:41,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:41,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:41,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:41,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:19:41,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:41,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:19:41,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:41,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:19:41,272 INFO L390 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 41 treesize of output 37 [2022-11-10 03:19:42,536 INFO L390 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 41 treesize of output 37 [2022-11-10 03:19:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:42,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:19:42,611 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-10 03:19:42,757 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-10 03:19:42,799 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-10 03:19:43,184 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-10 03:19:43,254 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)))) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))))) is different from false [2022-11-10 03:19:43,281 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0))))) is different from false [2022-11-10 03:19:43,938 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:19:43,940 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-11-10 03:19:43,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:19:43,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 56 [2022-11-10 03:19:43,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-10 03:19:44,027 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:19:44,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 03:19:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-10 03:19:44,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629867249] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:19:44,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:19:44,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 38 [2022-11-10 03:19:44,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853736904] [2022-11-10 03:19:44,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:19:44,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-10 03:19:44,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:44,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-10 03:19:44,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=816, Unknown=10, NotChecked=402, Total=1482 [2022-11-10 03:19:44,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:44,034 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:44,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 10.526315789473685) internal successors, (400), 39 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:19:44,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:44,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:44,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:44,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:44,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-10 03:19:44,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:44,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:19:44,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-10 03:19:44,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:19:44,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:54,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-10 03:19:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:19:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-10 03:19:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:19:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:19:54,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-10 03:19:54,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:19:54,238 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:54,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1324767981, now seen corresponding path program 4 times [2022-11-10 03:19:54,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:54,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586279127] [2022-11-10 03:19:54,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:54,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:55,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:55,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586279127] [2022-11-10 03:19:55,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586279127] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:19:55,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544892358] [2022-11-10 03:19:55,135 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-10 03:19:55,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:19:55,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:19:55,136 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-11-10 03:19:55,137 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-11-10 03:19:55,325 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-10 03:19:55,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:19:55,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-10 03:19:55,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:19:55,458 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:19:55,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 03:19:55,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:19:55,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:55,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:19:56,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:56,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-10 03:19:56,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:56,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:56,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:19:56,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:56,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:19:56,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:56,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:19:56,244 INFO L390 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 32 treesize of output 30 [2022-11-10 03:19:56,903 INFO L390 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 32 treesize of output 30 [2022-11-10 03:19:56,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:56,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:56,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:56,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:19:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:56,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:19:56,974 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_695 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_695 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_695 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-10 03:19:57,029 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_695 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))) (forall ((v_ArrVal_695 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_695 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-10 03:19:57,044 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_695 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_695 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_695 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-10 03:19:57,273 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_694 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_694) |c_~#arr~0.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_694 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_694) |c_~#arr~0.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_694 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_694) |c_~#arr~0.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-10 03:19:57,306 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_694 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_694) |c_~#arr~0.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_694 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_694) |c_~#arr~0.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_694 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_694) |c_~#arr~0.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))))) is different from false [2022-11-10 03:19:57,821 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (and (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_689))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_689))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_689))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_695) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)))) is different from false [2022-11-10 03:19:57,990 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:19:57,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 03:19:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-10 03:19:57,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544892358] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:19:57,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:19:57,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 15] total 39 [2022-11-10 03:19:57,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603789138] [2022-11-10 03:19:57,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:19:57,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-10 03:19:57,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:57,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-10 03:19:57,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=911, Unknown=40, NotChecked=414, Total=1560 [2022-11-10 03:19:57,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:58,000 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:58,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 10.205128205128204) internal successors, (398), 40 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:19:58,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:58,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:58,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:58,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:58,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-10 03:19:58,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:58,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:19:58,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-10 03:19:58,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:19:58,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:19:58,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:20:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-10 03:20:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-10 03:20:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:20:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:10,395 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-11-10 03:20:10,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:10,591 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:10,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:10,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1970140114, now seen corresponding path program 1 times [2022-11-10 03:20:10,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:10,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161911855] [2022-11-10 03:20:10,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:10,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10757 backedges. 5002 proven. 0 refuted. 0 times theorem prover too weak. 5755 trivial. 0 not checked. [2022-11-10 03:20:10,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:10,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161911855] [2022-11-10 03:20:10,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161911855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:20:10,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:20:10,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 03:20:10,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136731009] [2022-11-10 03:20:10,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:20:10,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 03:20:10,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:10,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 03:20:10,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 03:20:10,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:10,978 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:10,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:20:10,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:10,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:10,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:20:10,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:10,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-10 03:20:10,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:10,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:10,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-10 03:20:10,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:20:10,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:10,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:10,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.