/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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-10 03:18:35,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-10 03:18:35,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-10 03:18:35,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-10 03:18:35,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-10 03:18:35,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-10 03:18:35,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-10 03:18:35,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-10 03:18:35,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-10 03:18:35,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-10 03:18:35,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-10 03:18:35,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-10 03:18:35,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-10 03:18:35,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-10 03:18:35,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-10 03:18:35,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-10 03:18:35,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-10 03:18:35,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-10 03:18:35,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-10 03:18:35,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-10 03:18:35,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-10 03:18:35,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-10 03:18:35,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-10 03:18:35,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-10 03:18:35,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-10 03:18:35,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-10 03:18:35,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-10 03:18:35,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-10 03:18:35,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-10 03:18:35,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-10 03:18:35,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-10 03:18:35,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-10 03:18:35,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-10 03:18:35,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-10 03:18:35,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-10 03:18:35,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-10 03:18:35,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-10 03:18:35,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-10 03:18:35,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-10 03:18:35,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-10 03:18:35,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-10 03:18:35,964 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:35,987 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-10 03:18:35,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-10 03:18:35,988 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-10 03:18:35,988 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-10 03:18:35,988 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-10 03:18:35,989 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-10 03:18:35,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-10 03:18:35,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-10 03:18:35,989 INFO L138 SettingsManager]: * Use SBE=true [2022-11-10 03:18:35,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-10 03:18:35,990 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-10 03:18:35,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-10 03:18:35,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-10 03:18:35,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-10 03:18:35,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-10 03:18:35,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-10 03:18:35,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-10 03:18:35,990 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-10 03:18:35,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-10 03:18:35,991 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-10 03:18:35,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-10 03:18:35,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-10 03:18:35,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-10 03:18:35,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-10 03:18:35,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-10 03:18:35,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 03:18:35,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-10 03:18:35,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-10 03:18:35,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-10 03:18:35,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-10 03:18:35,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-10 03:18:35,993 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-10 03:18:35,993 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-10 03:18:35,993 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-10 03:18:35,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-10 03:18:35,993 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-10 03:18:35,993 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-10 03:18:35,993 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-10 03:18:35,993 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:36,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-10 03:18:36,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-10 03:18:36,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-10 03:18:36,192 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-10 03:18:36,193 INFO L275 PluginConnector]: CDTParser initialized [2022-11-10 03:18:36,194 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2022-11-10 03:18:36,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec77e6ab4/6d8a5f5ed0854e14aecfdcb7108c23b2/FLAGfa9f25fed [2022-11-10 03:18:36,819 INFO L306 CDTParser]: Found 1 translation units. [2022-11-10 03:18:36,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2022-11-10 03:18:36,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec77e6ab4/6d8a5f5ed0854e14aecfdcb7108c23b2/FLAGfa9f25fed [2022-11-10 03:18:37,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec77e6ab4/6d8a5f5ed0854e14aecfdcb7108c23b2 [2022-11-10 03:18:37,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-10 03:18:37,262 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-10 03:18:37,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-10 03:18:37,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-10 03:18:37,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-10 03:18:37,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:18:37" (1/1) ... [2022-11-10 03:18:37,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a036f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:37, skipping insertion in model container [2022-11-10 03:18:37,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:18:37" (1/1) ... [2022-11-10 03:18:37,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-10 03:18:37,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-10 03:18:37,655 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-1.i[41520,41533] [2022-11-10 03:18:37,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 03:18:37,697 INFO L203 MainTranslator]: Completed pre-run [2022-11-10 03:18:37,741 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-1.i[41520,41533] [2022-11-10 03:18:37,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 03:18:37,805 INFO L208 MainTranslator]: Completed translation [2022-11-10 03:18:37,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:37 WrapperNode [2022-11-10 03:18:37,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-10 03:18:37,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-10 03:18:37,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-10 03:18:37,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-10 03:18:37,812 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:37" (1/1) ... [2022-11-10 03:18:37,834 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:37" (1/1) ... [2022-11-10 03:18:37,857 INFO L138 Inliner]: procedures = 277, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 198 [2022-11-10 03:18:37,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-10 03:18:37,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-10 03:18:37,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-10 03:18:37,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-10 03:18:37,868 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:37" (1/1) ... [2022-11-10 03:18:37,870 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:37" (1/1) ... [2022-11-10 03:18:37,873 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:37" (1/1) ... [2022-11-10 03:18:37,873 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:37" (1/1) ... [2022-11-10 03:18:37,888 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:37" (1/1) ... [2022-11-10 03:18:37,891 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:37" (1/1) ... [2022-11-10 03:18:37,892 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:37" (1/1) ... [2022-11-10 03:18:37,893 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:37" (1/1) ... [2022-11-10 03:18:37,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-10 03:18:37,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-10 03:18:37,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-10 03:18:37,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-10 03:18:37,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:37" (1/1) ... [2022-11-10 03:18:37,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 03:18:37,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:18:37,940 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:37,946 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:37,999 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-10 03:18:37,999 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-10 03:18:38,002 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-10 03:18:38,002 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-10 03:18:38,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-10 03:18:38,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-10 03:18:38,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-10 03:18:38,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-10 03:18:38,002 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-10 03:18:38,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-10 03:18:38,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-10 03:18:38,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-10 03:18:38,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-10 03:18:38,004 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:38,111 INFO L235 CfgBuilder]: Building ICFG [2022-11-10 03:18:38,113 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-10 03:18:38,441 INFO L276 CfgBuilder]: Performing block encoding [2022-11-10 03:18:38,448 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-10 03:18:38,448 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-10 03:18:38,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:18:38 BoogieIcfgContainer [2022-11-10 03:18:38,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-10 03:18:38,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-10 03:18:38,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-10 03:18:38,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-10 03:18:38,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:18:37" (1/3) ... [2022-11-10 03:18:38,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573fcee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:18:38, skipping insertion in model container [2022-11-10 03:18:38,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:37" (2/3) ... [2022-11-10 03:18:38,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573fcee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:18:38, skipping insertion in model container [2022-11-10 03:18:38,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:18:38" (3/3) ... [2022-11-10 03:18:38,456 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-11-10 03:18:38,461 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-10 03:18:38,468 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-10 03:18:38,468 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-11-10 03:18:38,468 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-10 03:18:38,542 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-10 03:18:38,579 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 03:18:38,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 03:18:38,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:18:38,581 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:38,598 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:38,614 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 03:18:38,625 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 03:18:38,630 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;@308eea90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 03:18:38,630 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 03:18:38,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:38,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:38,866 INFO L85 PathProgramCache]: Analyzing trace with hash 397146121, now seen corresponding path program 1 times [2022-11-10 03:18:38,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:38,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881231588] [2022-11-10 03:18:38,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:18:39,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:39,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881231588] [2022-11-10 03:18:39,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881231588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:18:39,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:18:39,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 03:18:39,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121563268] [2022-11-10 03:18:39,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:18:39,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 03:18:39,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:18:39,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 03:18:39,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 03:18:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:39,478 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:18:39,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:18:39,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:39,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:39,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-10 03:18:39,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:39,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:39,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1977112786, now seen corresponding path program 1 times [2022-11-10 03:18:39,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:39,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039995920] [2022-11-10 03:18:39,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:39,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:41,115 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:41,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:41,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039995920] [2022-11-10 03:18:41,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039995920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:18:41,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:18:41,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-10 03:18:41,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473300590] [2022-11-10 03:18:41,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:18:41,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-10 03:18:41,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:18:41,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-10 03:18:41,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-10 03:18:41,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:41,125 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:18:41,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.142857142857143) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:41,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:41,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:41,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:41,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:18:41,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-10 03:18:41,902 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:41,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:41,902 INFO L85 PathProgramCache]: Analyzing trace with hash -839480496, now seen corresponding path program 1 times [2022-11-10 03:18:41,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:41,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904261882] [2022-11-10 03:18:41,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:41,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:43,182 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:43,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:43,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904261882] [2022-11-10 03:18:43,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904261882] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:18:43,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338101723] [2022-11-10 03:18:43,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:43,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:18:43,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:18:43,185 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:43,233 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:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:43,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-10 03:18:43,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:18:43,454 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:18:43,459 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:43,587 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:43,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:43,616 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:43,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:43,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:43,655 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:43,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:43,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:43,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:43,698 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:44,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:44,241 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:44,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:44,277 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:44,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:44,307 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:44,340 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:45,316 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:45,360 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:45,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:18:45,432 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_131 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_131) |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:18:45,545 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_131) |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:18:45,573 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_131 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))) (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_131) |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:18:46,354 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_131 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_131) |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:46,364 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_131 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_131 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_131) |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:18:46,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:18:46,418 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:18:46,423 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:18:46,423 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:18:46,426 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:18:46,496 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:18:46,496 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:18:46,499 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:18:46,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338101723] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:18:46,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:18:46,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 39 [2022-11-10 03:18:46,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751976484] [2022-11-10 03:18:46,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:18:46,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-10 03:18:46,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:18:46,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-10 03:18:46,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=963, Unknown=33, NotChecked=350, Total=1560 [2022-11-10 03:18:46,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:46,503 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:18:46,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 9.948717948717949) internal successors, (388), 40 states have internal predecessors, (388), 0 states have call successors, (0), 0 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:46,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:46,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:18:46,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:49,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:49,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:18:49,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:18:49,159 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:49,356 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,SelfDestructingSolverStorable2 [2022-11-10 03:18:49,357 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:49,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash -298260674, now seen corresponding path program 2 times [2022-11-10 03:18:49,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:49,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164603992] [2022-11-10 03:18:49,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:49,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:50,215 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,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:50,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164603992] [2022-11-10 03:18:50,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164603992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:18:50,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:18:50,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-10 03:18:50,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014738075] [2022-11-10 03:18:50,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:18:50,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-10 03:18:50,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:18:50,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-10 03:18:50,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-11-10 03:18:50,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:50,218 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:18:50,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.142857142857143) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 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,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:50,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:18:50,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:18:50,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:51,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:51,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:18:51,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:18:51,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:18:51,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-10 03:18:51,666 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:51,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:51,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1040124260, now seen corresponding path program 2 times [2022-11-10 03:18:51,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:51,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930151054] [2022-11-10 03:18:51,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:51,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:52,742 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:52,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:52,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930151054] [2022-11-10 03:18:52,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930151054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:18:52,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677111500] [2022-11-10 03:18:52,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 03:18:52,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:18:52,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:18:52,756 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,775 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,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-10 03:18:52,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:18:52,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-10 03:18:52,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:18:52,940 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:18:52,941 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:53,015 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:53,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:53,041 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:53,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:53,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:53,073 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:53,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:53,478 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:18:53,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:53,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:53,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:53,496 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:53,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:53,541 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:53,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:53,557 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:53,572 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:54,353 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:54,393 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:18:54,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:18:54,406 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_244 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_244 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))) (forall ((v_ArrVal_244 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_244 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_244) |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:18:54,521 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_244 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_244 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_244 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_244 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_244) |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:55,095 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_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_243) |c_~#arr~0.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_243) |c_~#arr~0.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_243) |c_~#arr~0.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_243) |c_~#arr~0.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-10 03:18:55,114 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_238))) (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_243) |c_~#arr~0.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_238))) (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_243) |c_~#arr~0.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_238))) (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_243) |c_~#arr~0.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_238))) (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_243) |c_~#arr~0.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-10 03:18:55,251 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_238))) (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_243) |c_~#arr~0.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_238))) (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_243) |c_~#arr~0.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_238))) (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_243) |c_~#arr~0.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_238))) (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_243) |c_~#arr~0.base| v_ArrVal_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-10 03:18:55,278 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_238))) (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_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_238))) (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_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_238))) (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_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_~#arr~0.base| v_ArrVal_238))) (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_244) |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:18:55,411 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |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|) .cse5 0))) (.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (let ((.cse0 (store .cse2 |c_~#arr~0.base| v_ArrVal_238))) (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_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (let ((.cse3 (store .cse2 |c_~#arr~0.base| v_ArrVal_238))) (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_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (let ((.cse4 (store .cse2 |c_~#arr~0.base| v_ArrVal_238))) (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_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (= (select (select (store (let ((.cse6 (store .cse2 |c_~#arr~0.base| v_ArrVal_238))) (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_244) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-10 03:18:55,472 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:18:55,472 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:18:55,476 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:18:55,476 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:18:55,481 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:18:55,551 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:18:55,552 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:18:55,555 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:18:55,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677111500] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:18:55,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:18:55,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 42 [2022-11-10 03:18:55,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000099280] [2022-11-10 03:18:55,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:18:55,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-10 03:18:55,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:18:55,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-10 03:18:55,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1040, Unknown=43, NotChecked=518, Total=1806 [2022-11-10 03:18:55,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:55,558 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:18:55,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 9.80952380952381) internal successors, (412), 43 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:18:55,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:55,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:18:55,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:18:55,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:18:55,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:18:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:18:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:18:58,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:18:58,131 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:58,316 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:58,316 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:58,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1993584203, now seen corresponding path program 1 times [2022-11-10 03:18:58,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:58,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239070233] [2022-11-10 03:18:58,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:58,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3483 backedges. 1353 proven. 0 refuted. 0 times theorem prover too weak. 2130 trivial. 0 not checked. [2022-11-10 03:18:59,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:59,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239070233] [2022-11-10 03:18:59,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239070233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:18:59,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:18:59,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 03:18:59,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980469637] [2022-11-10 03:18:59,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:18:59,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 03:18:59,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:18:59,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 03:18:59,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 03:18:59,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:59,109 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:18:59,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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:59,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:59,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:18:59,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:18:59,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:18:59,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:18:59,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:00,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:00,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:00,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:19:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-10 03:19:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:00,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-10 03:19:00,291 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:00,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash 49337106, now seen corresponding path program 3 times [2022-11-10 03:19:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:00,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826495878] [2022-11-10 03:19:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:00,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:00,645 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:00,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:00,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826495878] [2022-11-10 03:19:00,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826495878] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:19:00,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:19:00,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-10 03:19:00,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275200597] [2022-11-10 03:19:00,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:19:00,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-10 03:19:00,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:00,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-10 03:19:00,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-10 03:19:00,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:00,648 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:00,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:00,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:00,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:00,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:19:00,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:00,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-10 03:19:00,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:00,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:19:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-10 03:19:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:01,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-10 03:19:01,552 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:01,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:01,553 INFO L85 PathProgramCache]: Analyzing trace with hash -818720654, now seen corresponding path program 4 times [2022-11-10 03:19:01,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:01,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633467951] [2022-11-10 03:19:01,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:01,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:01,823 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:01,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:01,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633467951] [2022-11-10 03:19:01,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633467951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:19:01,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:19:01,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-10 03:19:01,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633827211] [2022-11-10 03:19:01,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:19:01,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-10 03:19:01,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:01,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-10 03:19:01,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-10 03:19:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:01,825 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:01,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:01,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:01,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:01,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:19:01,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:01,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-10 03:19:01,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:01,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:01,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:19:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-10 03:19:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:02,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:02,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-10 03:19:02,924 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:02,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1485336891, now seen corresponding path program 1 times [2022-11-10 03:19:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:02,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636272888] [2022-11-10 03:19:02,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:02,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:03,204 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:03,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:03,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636272888] [2022-11-10 03:19:03,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636272888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:19:03,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:19:03,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-10 03:19:03,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363977070] [2022-11-10 03:19:03,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:19:03,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-10 03:19:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:03,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-10 03:19:03,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-10 03:19:03,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:03,209 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:03,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 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:03,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:03,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:03,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:19:03,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:03,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-10 03:19:03,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:03,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:03,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:03,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:19:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:19:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:04,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:19:04,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-10 03:19:04,208 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:04,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:04,208 INFO L85 PathProgramCache]: Analyzing trace with hash -688283958, now seen corresponding path program 1 times [2022-11-10 03:19:04,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:04,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559822459] [2022-11-10 03:19:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:04,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:04,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:04,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559822459] [2022-11-10 03:19:04,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559822459] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:19:04,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287582420] [2022-11-10 03:19:04,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:04,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:19:04,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:19:04,326 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:19:04,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-10 03:19:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:04,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-10 03:19:04,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:19:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:04,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:19:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:04,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287582420] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:19:04,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:19:04,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-10 03:19:04,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562174786] [2022-11-10 03:19:04,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:19:04,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-10 03:19:04,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:04,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-10 03:19:04,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-10 03:19:04,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:04,695 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:04,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 39.5) internal successors, (395), 10 states have internal predecessors, (395), 0 states have call successors, (0), 0 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:04,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:04,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:04,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:19:04,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:04,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:19:04,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:04,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:04,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:04,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:19:04,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:19:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:19:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:19:06,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:19:06,158 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:06,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:19:06,321 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:06,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:06,322 INFO L85 PathProgramCache]: Analyzing trace with hash -829653058, now seen corresponding path program 3 times [2022-11-10 03:19:06,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:06,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567239817] [2022-11-10 03:19:06,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:06,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:06,858 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:06,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:06,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567239817] [2022-11-10 03:19:06,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567239817] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:19:06,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513419054] [2022-11-10 03:19:06,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-10 03:19:06,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:19:06,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:19:06,860 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:06,906 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:06,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-10 03:19:06,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:19:06,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-10 03:19:07,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:19:07,049 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:19:07,049 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:07,321 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:07,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:07,353 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:07,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:07,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:07,391 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:07,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:07,434 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:07,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:07,451 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:07,464 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:08,031 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:08,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:08,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:08,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:08,067 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:08,094 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:08,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:19:08,113 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_670 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_670 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_670 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_670) |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:08,198 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_670 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_670 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_670 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_670) |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:08,569 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_669 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_669) |c_~#arr~0.base| v_ArrVal_670) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_669) |c_~#arr~0.base| v_ArrVal_670) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_669) |c_~#arr~0.base| v_ArrVal_670) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-10 03:19:08,712 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:19:08,713 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:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-10 03:19:08,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513419054] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:19:08,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:19:08,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 32 [2022-11-10 03:19:08,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363636242] [2022-11-10 03:19:08,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:19:08,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-10 03:19:08,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:08,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-10 03:19:08,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=704, Unknown=21, NotChecked=174, Total=1056 [2022-11-10 03:19:08,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:08,718 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:08,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 10.75) internal successors, (344), 33 states have internal predecessors, (344), 0 states have call successors, (0), 0 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:08,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:08,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:08,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:19:08,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:08,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:19:08,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:08,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:08,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:08,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:19:08,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:19:08,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:10,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:19:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:19:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:19:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:19:10,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:19:10,988 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:11,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-10 03:19:11,180 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:11,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:11,181 INFO L85 PathProgramCache]: Analyzing trace with hash 50568159, now seen corresponding path program 4 times [2022-11-10 03:19:11,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:11,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247802368] [2022-11-10 03:19:11,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:11,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:13,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:13,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247802368] [2022-11-10 03:19:13,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247802368] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:19:13,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779819824] [2022-11-10 03:19:13,368 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-10 03:19:13,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:19:13,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:19:13,369 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:13,370 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:13,558 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-10 03:19:13,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:19:13,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-10 03:19:13,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:19:13,715 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:19:13,716 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:14,268 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:14,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:14,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, 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:14,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:14,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:14,384 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:14,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:14,452 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:14,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:14,486 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:14,509 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:15,603 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:15,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:15,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:15,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:15,637 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:15,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:15,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:15,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:15,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 59 [2022-11-10 03:19:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:15,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:19:15,990 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| 1 (* |c_t1Thread1of1ForFork0_push_#t~ret36#1| 4))) (.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_765 Int)) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_762))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base|) .cse1 v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_765 Int)) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_762))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse4 |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select .cse4 |c_t1Thread1of1ForFork0_push_~stack#1.base|) .cse1 v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_765 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_762))) (store .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse6 |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select .cse6 |c_t1Thread1of1ForFork0_push_~stack#1.base|) .cse1 v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_765 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_762))) (store .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse8 |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select .cse8 |c_t1Thread1of1ForFork0_push_~stack#1.base|) .cse1 v_ArrVal_765))) |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:16,079 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int)) (or (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_765 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_762))) (store .cse1 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret36#1_48|)))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int)) (or (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_765 Int)) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_762))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse3 |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select .cse3 |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret36#1_48|)))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int)) (or (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_765 Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_762))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse5 |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select .cse5 |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0)) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret36#1_48|)))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int)) (or (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_765 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_762))) (store .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse7 |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select .cse7 |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret36#1_48|)))))) is different from false [2022-11-10 03:19:16,119 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| c_~top~0) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_762))) (store .cse1 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) (forall ((v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_762))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse3 |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select .cse3 |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| c_~top~0))) (forall ((v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_762))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse5 |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select .cse5 |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| c_~top~0))) (forall ((v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_762))) (store .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse7 |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select .cse7 |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| c_~top~0))))) is different from false [2022-11-10 03:19:16,450 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int)) (or (forall ((v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_762))) (store .cse1 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| c_~top~0))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_41|)))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_41|)) (forall ((v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (= 0 (select (select (let ((.cse3 (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_762))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse3 |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select .cse3 |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1))) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| c_~top~0))))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_41|)) (forall ((v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_762))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse5 |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select .cse5 |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| c_~top~0))))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int)) (or (forall ((v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_762))) (store .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse7 |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select .cse7 |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| c_~top~0))) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_41|)))))) is different from false [2022-11-10 03:19:16,650 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_~#arr~0.base| v_ArrVal_762))) (store .cse1 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse0 |c_~#arr~0.base| (store (select .cse0 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| c_~top~0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| c_~top~0) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#race| |c_~#arr~0.base| v_ArrVal_762))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse3 |c_~#arr~0.base| (store (select .cse3 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| c_~top~0) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_~#arr~0.base| v_ArrVal_762))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse5 |c_~#arr~0.base| (store (select .cse5 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_~#arr~0.base| v_ArrVal_762))) (store .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse7 |c_~#arr~0.base| (store (select .cse7 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| c_~top~0))))) is different from false [2022-11-10 03:19:17,912 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_762))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse1 |c_~#arr~0.base| (store (select .cse1 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_~#arr~0.base| v_ArrVal_762))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse4 |c_~#arr~0.base| (store (select .cse4 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_~#arr~0.base| v_ArrVal_762))) (store .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse6 |c_~#arr~0.base| (store (select .cse6 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_~#arr~0.base| v_ArrVal_762))) (store .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse8 |c_~#arr~0.base| (store (select .cse8 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |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:17,970 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~top~0 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_762))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse1 |c_~#arr~0.base| (store (select .cse1 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_~#arr~0.base| v_ArrVal_762))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse4 |c_~#arr~0.base| (store (select .cse4 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_~#arr~0.base| v_ArrVal_762))) (store .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse6 |c_~#arr~0.base| (store (select .cse6 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_~#arr~0.base| v_ArrVal_762))) (store .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse8 |c_~#arr~0.base| (store (select .cse8 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |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:18,327 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~top~0 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (= (select (select (let ((.cse1 (let ((.cse2 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_761) |c_~#arr~0.base| v_ArrVal_762))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse1 |c_~#arr~0.base| (store (select .cse1 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (= (select (select (let ((.cse4 (let ((.cse5 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_761) |c_~#arr~0.base| v_ArrVal_762))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse4 |c_~#arr~0.base| (store (select .cse4 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (= (select (select (let ((.cse6 (let ((.cse7 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_761) |c_~#arr~0.base| v_ArrVal_762))) (store .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse6 |c_~#arr~0.base| (store (select .cse6 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (= (select (select (let ((.cse8 (let ((.cse9 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_761) |c_~#arr~0.base| v_ArrVal_762))) (store .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse8 |c_~#arr~0.base| (store (select .cse8 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0))))) is different from false [2022-11-10 03:19:18,462 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse0 (+ c_~top~0 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse5 0)))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (= (select (select (let ((.cse1 (let ((.cse2 (store (store .cse4 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_761) |c_~#arr~0.base| v_ArrVal_762))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse1 |c_~#arr~0.base| (store (select .cse1 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse5) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (= (select (select (let ((.cse6 (let ((.cse7 (store (store .cse4 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_761) |c_~#arr~0.base| v_ArrVal_762))) (store .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse6 |c_~#arr~0.base| (store (select .cse6 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (= (select (select (let ((.cse8 (let ((.cse9 (store (store .cse4 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_761) |c_~#arr~0.base| v_ArrVal_762))) (store .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse8 |c_~#arr~0.base| (store (select .cse8 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse0) (= (select (select (let ((.cse10 (let ((.cse11 (store (store .cse4 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_761) |c_~#arr~0.base| v_ArrVal_762))) (store .cse11 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))))) (store .cse10 |c_~#arr~0.base| (store (select .cse10 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |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,500 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) (.cse10 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse4 (+ c_~top~0 1)) (.cse2 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse7 0) .cse10 0)))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (= (select (select (let ((.cse0 (let ((.cse1 (store (store .cse3 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_761) |c_~#arr~0.base| v_ArrVal_762))) (store .cse1 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse0 |c_~#arr~0.base| (store (select .cse0 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse4))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse4) (= 0 (select (select (let ((.cse5 (let ((.cse6 (store (store .cse3 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_761) |c_~#arr~0.base| v_ArrVal_762))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse5 |c_~#arr~0.base| (store (select .cse5 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse7)))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse4) (= (select (select (let ((.cse8 (let ((.cse9 (store (store .cse3 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_761) |c_~#arr~0.base| v_ArrVal_762))) (store .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse8 |c_~#arr~0.base| (store (select .cse8 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse10) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_41| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (|v_t1Thread1of1ForFork0_push_#t~ret36#1_48| Int) (v_ArrVal_765 Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| |c_~#arr~0.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| .cse4) (= (select (select (let ((.cse11 (let ((.cse12 (store (store .cse3 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_761) |c_~#arr~0.base| v_ArrVal_762))) (store .cse12 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0))))) (store .cse11 |c_~#arr~0.base| (store (select .cse11 |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_41| (* |v_t1Thread1of1ForFork0_push_#t~ret36#1_48| 4) 1) v_ArrVal_765))) |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:18,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:19:18,521 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 138 treesize of output 95 [2022-11-10 03:19:18,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 368 [2022-11-10 03:19:18,550 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 438 treesize of output 398 [2022-11-10 03:19:18,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 212 [2022-11-10 03:19:18,569 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 210 treesize of output 198 [2022-11-10 03:19:18,607 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-10 03:19:18,607 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 1 [2022-11-10 03:19:18,613 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-10 03:19:18,613 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 1 [2022-11-10 03:19:18,619 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-10 03:19:18,620 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 1 [2022-11-10 03:19:18,796 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:19:18,796 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:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 32 not checked. [2022-11-10 03:19:18,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779819824] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:19:18,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:19:18,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 55 [2022-11-10 03:19:18,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456159852] [2022-11-10 03:19:18,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:19:18,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-10 03:19:18,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:18,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-10 03:19:18,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1825, Unknown=10, NotChecked=970, Total=3080 [2022-11-10 03:19:18,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:18,821 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:18,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 7.581818181818182) internal successors, (417), 56 states have internal predecessors, (417), 0 states have call successors, (0), 0 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:18,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:18,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:18,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:19:18,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:18,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:19:18,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:18,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:18,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:18,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:19:18,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:19:18,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:19:18,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:19:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:19:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:19:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:19:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:19:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:19:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:19:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:19:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-10 03:19:55,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-10 03:19:55,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:19:55,581 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:55,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:55,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1567622141, now seen corresponding path program 5 times [2022-11-10 03:19:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:55,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825140334] [2022-11-10 03:19:55,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:55,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:57,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:57,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825140334] [2022-11-10 03:19:57,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825140334] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:19:57,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698895441] [2022-11-10 03:19:57,753 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-10 03:19:57,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:19:57,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:19:57,755 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:57,756 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:57,890 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-10 03:19:57,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:19:57,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-10 03:19:57,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:19:58,040 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:19:58,041 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:58,345 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:58,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:58,373 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:58,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:58,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:58,408 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:58,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:58,453 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:58,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:58,472 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:58,488 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:59,138 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:59,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:59,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:59,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:59,154 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:59,204 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:59,227 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:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:59,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:19:59,298 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_864) |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:59,472 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_860))) (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_864) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_860))) (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_864) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_860))) (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_864) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= 0 (select (select (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_860))) (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_864) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))))) is different from false [2022-11-10 03:19:59,671 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_860))) (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_864) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_860))) (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_864) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= 0 (select (select (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_860))) (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_864) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_860))) (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_864) |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:59,698 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_860))) (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_864) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_860))) (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_864) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_860))) (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_864) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_~#arr~0.base| v_ArrVal_860))) (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_864) |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:20:00,520 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:00,521 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 68 treesize of output 61 [2022-11-10 03:20:00,526 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:00,527 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 140 treesize of output 120 [2022-11-10 03:20:00,531 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 54 treesize of output 52 [2022-11-10 03:20:00,532 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 68 treesize of output 62 [2022-11-10 03:20:00,534 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 48 treesize of output 46 [2022-11-10 03:20:00,548 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-10 03:20:00,549 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 1 [2022-11-10 03:20:00,746 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:20:00,747 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:20:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 33 not checked. [2022-11-10 03:20:00,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698895441] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:20:00,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:20:00,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 15] total 48 [2022-11-10 03:20:00,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737365793] [2022-11-10 03:20:00,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:20:00,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-10 03:20:00,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:00,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-10 03:20:00,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1647, Unknown=96, NotChecked=356, Total=2352 [2022-11-10 03:20:00,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:00,777 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:00,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 8.729166666666666) internal successors, (419), 49 states have internal predecessors, (419), 0 states have call successors, (0), 0 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:00,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:00,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:00,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:20:00,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:00,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:20:00,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:00,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:00,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:20:00,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:00,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:00,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:20:00,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-10 03:20:00,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:20:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:20:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:20:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:20:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-10 03:20:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 03:20:06,240 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:06,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:06,431 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:06,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1871568668, now seen corresponding path program 6 times [2022-11-10 03:20:06,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:06,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841454385] [2022-11-10 03:20:06,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:06,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:07,679 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:07,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:07,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841454385] [2022-11-10 03:20:07,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841454385] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:20:07,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537341294] [2022-11-10 03:20:07,679 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-10 03:20:07,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:07,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:20:07,681 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:20:07,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-10 03:20:08,057 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-10 03:20:08,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:20:08,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-10 03:20:08,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:20:08,205 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:20:08,205 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:20:08,650 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:20:08,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:08,682 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:20:08,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:08,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:08,733 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:20:08,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:08,777 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:20:08,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:08,796 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:20:08,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 32 treesize of output 30 [2022-11-10 03:20:09,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:09,329 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:20:09,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:09,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:09,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:09,341 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:20:09,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:09,385 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:20:09,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:09,402 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:20:09,433 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:20:10,383 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:20:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 46 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:10,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:20:10,461 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_984 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_984) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_984 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_984) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_984 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_984) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_984 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_984) |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:20:10,708 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_984 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_984) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_984 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_984) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_984 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_984) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_984 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_984) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|)))) is different from false [2022-11-10 03:20:12,024 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_~#arr~0.base|)) (forall ((v_ArrVal_977 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_977 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_977 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_977) |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:20:12,065 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 (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_~#arr~0.base|)) (forall ((v_ArrVal_977 (Array Int Int))) (= (select (select (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_977 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1))) (forall ((v_ArrVal_977 (Array Int Int))) (= (select (select (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_977) |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:20:12,086 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (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 (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_~#arr~0.base|)) (forall ((v_ArrVal_977 (Array Int Int))) (= (select (select (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_977 (Array Int Int))) (= (select (select (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_977 (Array Int Int))) (= (select (select (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0))))) is different from false [2022-11-10 03:20:12,101 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:12,101 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2022-11-10 03:20:12,108 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:12,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 54 treesize of output 32 [2022-11-10 03:20:12,113 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 7 treesize of output 3 [2022-11-10 03:20:12,122 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-10 03:20:12,122 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 1 [2022-11-10 03:20:12,130 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-10 03:20:12,130 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 1 [2022-11-10 03:20:12,301 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:20:12,302 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:20:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 31 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 84 not checked. [2022-11-10 03:20:12,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537341294] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:20:12,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:20:12,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 17] total 43 [2022-11-10 03:20:12,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263621666] [2022-11-10 03:20:12,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:20:12,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-10 03:20:12,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:12,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-10 03:20:12,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1247, Unknown=34, NotChecked=390, Total=1892 [2022-11-10 03:20:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:12,312 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:12,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 11.372093023255815) internal successors, (489), 44 states have internal predecessors, (489), 0 states have call successors, (0), 0 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:12,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:12,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:12,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:20:12,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:12,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:20:12,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:12,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:12,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:20:12,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:12,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:12,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:20:12,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-10 03:20:12,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 03:20:12,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:20:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:20:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:20:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:20:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-10 03:20:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-10 03:20:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:20:18,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-10 03:20:18,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-10 03:20:18,863 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:18,863 INFO L85 PathProgramCache]: Analyzing trace with hash -386308020, now seen corresponding path program 7 times [2022-11-10 03:20:18,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:18,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226326019] [2022-11-10 03:20:18,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:18,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 29 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:22,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:22,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226326019] [2022-11-10 03:20:22,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226326019] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:20:22,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224421473] [2022-11-10 03:20:22,773 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-10 03:20:22,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:22,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:20:22,774 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:20:22,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-10 03:20:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:22,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-10 03:20:22,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:20:23,016 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:20:23,017 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:20:23,294 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:20:23,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:23,336 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:20:23,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:23,386 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:20:23,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:23,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:23,399 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:20:23,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:23,458 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:20:23,471 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:20:24,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:24,016 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:20:24,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:24,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:24,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:24,032 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:20:24,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:24,094 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:20:24,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:24,115 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:20:24,129 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:20:24,858 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:20:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:24,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:20:24,925 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1104) |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:20:25,007 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1104) |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:20:25,028 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1104 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)))) (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1104) |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:20:25,970 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1098))) (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_1103) |c_~#arr~0.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1098))) (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_1103) |c_~#arr~0.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1098))) (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_1103) |c_~#arr~0.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1098))) (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_1103) |c_~#arr~0.base| v_ArrVal_1104) |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:20:26,136 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1098))) (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_1103) |c_~#arr~0.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1098))) (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_1103) |c_~#arr~0.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1098))) (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_1103) |c_~#arr~0.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1098))) (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_1103) |c_~#arr~0.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-10 03:20:26,164 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1098))) (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_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1098))) (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_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1098))) (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_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1098))) (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_1104) |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:20:26,436 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1097 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1097) |c_~#arr~0.base| v_ArrVal_1098))) (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_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1097 (Array Int Int))) (= (select (select (store (let ((.cse2 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1097) |c_~#arr~0.base| v_ArrVal_1098))) (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_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1097 (Array Int Int))) (= (select (select (store (let ((.cse3 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1097) |c_~#arr~0.base| v_ArrVal_1098))) (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_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1097 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1097) |c_~#arr~0.base| v_ArrVal_1098))) (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_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-10 03:20:26,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:26,997 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 116 treesize of output 83 [2022-11-10 03:20:27,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:27,003 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 370 treesize of output 356 [2022-11-10 03:20:27,009 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 310 treesize of output 300 [2022-11-10 03:20:27,017 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 300 treesize of output 294 [2022-11-10 03:20:27,019 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 294 treesize of output 272 [2022-11-10 03:20:27,023 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 206 treesize of output 202 [2022-11-10 03:20:27,240 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:20:27,240 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:20:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 120 not checked. [2022-11-10 03:20:27,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224421473] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:20:27,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:20:27,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16, 19] total 59 [2022-11-10 03:20:27,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402548827] [2022-11-10 03:20:27,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:20:27,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-10 03:20:27,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:27,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-10 03:20:27,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=2330, Unknown=101, NotChecked=756, Total=3540 [2022-11-10 03:20:27,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:27,246 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:27,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 9.983050847457626) internal successors, (589), 60 states have internal predecessors, (589), 0 states have call successors, (0), 0 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:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:20:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:20:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:20:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:20:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-10 03:20:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-10 03:20:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:20:27,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:20:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:20:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:20:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:20:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-10 03:20:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:20:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:20:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-10 03:20:35,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-10 03:20:35,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-10 03:20:35,455 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:35,455 INFO L85 PathProgramCache]: Analyzing trace with hash 46557120, now seen corresponding path program 8 times [2022-11-10 03:20:35,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:35,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835786323] [2022-11-10 03:20:35,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:35,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:36,898 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:20:36,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:36,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835786323] [2022-11-10 03:20:36,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835786323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:20:36,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819415452] [2022-11-10 03:20:36,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 03:20:36,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:36,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:20:36,901 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:20:36,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-10 03:20:37,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-10 03:20:37,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:20:37,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-10 03:20:37,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:20:37,133 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:20:37,133 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:20:37,384 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:20:37,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:37,422 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:20:37,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:37,467 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:20:37,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:37,477 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:20:37,488 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 23 treesize of output 23 [2022-11-10 03:20:37,828 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 23 treesize of output 23 [2022-11-10 03:20:37,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:37,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:37,853 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:20:37,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:37,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:37,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:37,883 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:20:37,915 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:20:37,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:20:37,927 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1188 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1188) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1188 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1188) |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:20:38,035 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1188 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1188) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1188 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1188) |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:20:38,210 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1))) (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_1188 (Array Int Int)) (v_ArrVal_1187 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1187) |c_~#arr~0.base| v_ArrVal_1188) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1187 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1187) |c_~#arr~0.base| v_ArrVal_1188) |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:20:38,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:38,216 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 26 treesize of output 32 [2022-11-10 03:20:38,218 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:38,218 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 132 treesize of output 114 [2022-11-10 03:20:38,222 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 45 treesize of output 41 [2022-11-10 03:20:38,224 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 86 treesize of output 78 [2022-11-10 03:20:38,242 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-10 03:20:38,242 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2022-11-10 03:20:38,471 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:20:38,471 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:20:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2022-11-10 03:20:38,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819415452] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:20:38,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:20:38,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 42 [2022-11-10 03:20:38,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62254698] [2022-11-10 03:20:38,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:20:38,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-10 03:20:38,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:38,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-10 03:20:38,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1336, Unknown=37, NotChecked=234, Total=1806 [2022-11-10 03:20:38,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:38,476 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:38,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 9.761904761904763) internal successors, (410), 43 states have internal predecessors, (410), 0 states have call successors, (0), 0 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:38,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:38,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:38,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:20:38,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:38,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:20:38,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:38,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:38,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:20:38,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:38,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:38,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:20:38,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-10 03:20:38,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:20:38,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:20:38,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-10 03:20:38,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:20:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:20:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:20:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:20:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-10 03:20:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:20:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:20:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-10 03:20:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:20:46,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-10 03:20:47,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-10 03:20:47,188 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:47,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash -140688036, now seen corresponding path program 9 times [2022-11-10 03:20:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:47,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057902045] [2022-11-10 03:20:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:48,501 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:20:48,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:48,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057902045] [2022-11-10 03:20:48,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057902045] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:20:48,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99741864] [2022-11-10 03:20:48,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-10 03:20:48,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:48,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:20:48,507 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:20:48,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-10 03:20:48,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-10 03:20:48,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:20:48,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-10 03:20:48,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:20:48,721 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:20:48,721 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:20:48,933 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:20:48,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:48,970 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 14 treesize of output 16 [2022-11-10 03:20:48,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:48,979 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:20:49,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:49,024 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:20:49,033 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 23 treesize of output 23 [2022-11-10 03:20:49,510 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 23 treesize of output 23 [2022-11-10 03:20:49,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:49,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:49,546 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:20:49,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:49,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:49,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:49,587 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:20:49,629 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:20:49,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:20:49,809 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1276 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1276) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1276 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1276) |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:20:51,975 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1))) (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_1276 (Array Int Int)) (v_ArrVal_1275 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1275) |c_~#arr~0.base| v_ArrVal_1276) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1275 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1275) |c_~#arr~0.base| v_ArrVal_1276) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-10 03:20:52,048 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:52,048 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 1 case distinctions, treesize of input 45 treesize of output 38 [2022-11-10 03:20:52,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 172 [2022-11-10 03:20:52,053 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 160 treesize of output 148 [2022-11-10 03:20:52,055 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 148 treesize of output 142 [2022-11-10 03:20:52,058 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 102 treesize of output 98 [2022-11-10 03:20:52,478 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:20:52,479 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:20:52,481 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-10 03:20:52,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99741864] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:20:52,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:20:52,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 15] total 43 [2022-11-10 03:20:52,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815628218] [2022-11-10 03:20:52,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:20:52,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-10 03:20:52,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:52,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-10 03:20:52,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1451, Unknown=63, NotChecked=162, Total=1892 [2022-11-10 03:20:52,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:52,485 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:52,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 9.534883720930232) internal successors, (410), 44 states have internal predecessors, (410), 0 states have call successors, (0), 0 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:52,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:52,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:52,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:20:52,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:52,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:20:52,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:52,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:52,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:20:52,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:52,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:52,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:20:52,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-10 03:20:52,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:20:52,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:20:52,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-10 03:20:52,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:20:52,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:21:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:21:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:21:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:21:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:21:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:21:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:21:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:21:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:21:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-10 03:21:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:21:02,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:21:02,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-10 03:21:02,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:21:02,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:21:02,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-10 03:21:02,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-10 03:21:02,825 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:21:02,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:21:02,826 INFO L85 PathProgramCache]: Analyzing trace with hash 523878534, now seen corresponding path program 10 times [2022-11-10 03:21:02,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:21:02,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711976402] [2022-11-10 03:21:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:21:02,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:21:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:21:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 29 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:21:06,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:21:06,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711976402] [2022-11-10 03:21:06,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711976402] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:21:06,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090009555] [2022-11-10 03:21:06,894 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-10 03:21:06,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:21:06,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:21:06,895 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:21:06,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-10 03:21:07,289 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-10 03:21:07,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:21:07,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-10 03:21:07,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:21:07,405 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:21:07,405 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:21:07,656 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:21:07,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:07,694 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 14 treesize of output 16 [2022-11-10 03:21:07,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:07,703 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:21:07,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:07,750 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:21:07,778 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 23 treesize of output 23 [2022-11-10 03:21:08,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:08,140 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:21:08,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:08,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:08,153 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:21:08,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:08,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:08,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:08,220 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:21:08,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:08,293 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:21:08,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:08,319 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:21:08,332 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:21:08,955 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:21:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:21:08,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:21:09,009 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1400 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1400) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1400 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1400) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1400 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1400) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1400 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1400) |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:21:09,077 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1400 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1400) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1400 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1400) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1400 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1400) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1400 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1400) |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:21:11,758 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_1400 (Array Int Int)) (v_ArrVal_1399 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1399) |c_~#arr~0.base| v_ArrVal_1400) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1400 (Array Int Int)) (v_ArrVal_1399 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1399) |c_~#arr~0.base| v_ArrVal_1400) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1400 (Array Int Int)) (v_ArrVal_1399 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1399) |c_~#arr~0.base| v_ArrVal_1400) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1400 (Array Int Int)) (v_ArrVal_1399 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1399) |c_~#arr~0.base| v_ArrVal_1400) |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:21:12,792 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse6 0)))) (and (forall ((v_ArrVal_1400 (Array Int Int)) (v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store .cse3 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1391) |c_~#arr~0.base| v_ArrVal_1392))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0) .cse2 0))) |c_~#arr~0.base| v_ArrVal_1400) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1400 (Array Int Int)) (v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store .cse3 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1391) |c_~#arr~0.base| v_ArrVal_1392))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0) .cse2 0))) |c_~#arr~0.base| v_ArrVal_1400) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1400 (Array Int Int)) (v_ArrVal_1392 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (= (select (select (store (let ((.cse5 (store (store .cse3 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1391) |c_~#arr~0.base| v_ArrVal_1392))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0) .cse2 0))) |c_~#arr~0.base| v_ArrVal_1400) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse6) 0))))) is different from false [2022-11-10 03:21:12,921 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:21:12,922 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 1 case distinctions, treesize of input 101 treesize of output 78 [2022-11-10 03:21:12,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 362 treesize of output 350 [2022-11-10 03:21:12,932 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 330 treesize of output 318 [2022-11-10 03:21:12,948 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 318 treesize of output 294 [2022-11-10 03:21:12,953 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 102 treesize of output 100 [2022-11-10 03:21:12,958 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 292 treesize of output 286 [2022-11-10 03:21:13,233 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:21:13,234 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:21:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 46 proven. 0 refuted. 39 times theorem prover too weak. 0 trivial. 36 not checked. [2022-11-10 03:21:13,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090009555] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:21:13,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:21:13,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16, 19] total 58 [2022-11-10 03:21:13,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027585163] [2022-11-10 03:21:13,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:21:13,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-10 03:21:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:21:13,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-10 03:21:13,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=2465, Unknown=135, NotChecked=436, Total=3422 [2022-11-10 03:21:13,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:21:13,240 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:21:13,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 10.155172413793103) internal successors, (589), 59 states have internal predecessors, (589), 0 states have call successors, (0), 0 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:21:13,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:21:13,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:21:13,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:21:13,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:21:13,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:21:13,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:13,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:21:13,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:21:13,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:13,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:13,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:21:13,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-10 03:21:13,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:21:13,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:21:13,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-10 03:21:13,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:21:13,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:21:13,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:21:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:21:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:21:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:21:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:21:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:21:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:21:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:21:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:21:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-10 03:21:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:21:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:21:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-10 03:21:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:21:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:21:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:21:24,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-10 03:21:24,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-10 03:21:24,233 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:21:24,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:21:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1447426450, now seen corresponding path program 2 times [2022-11-10 03:21:24,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:21:24,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561809210] [2022-11-10 03:21:24,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:21:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:21:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:21:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 31 proven. 237 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:21:24,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:21:24,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561809210] [2022-11-10 03:21:24,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561809210] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:21:24,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294756945] [2022-11-10 03:21:24,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 03:21:24,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:21:24,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:21:24,494 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:21:24,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-10 03:21:24,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-10 03:21:24,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:21:24,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-10 03:21:24,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:21:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 31 proven. 237 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:21:24,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:21:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 31 proven. 237 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:21:25,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294756945] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:21:25,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:21:25,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-11-10 03:21:25,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39258689] [2022-11-10 03:21:25,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:21:25,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-10 03:21:25,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:21:25,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-10 03:21:25,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-10 03:21:25,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:21:25,174 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:21:25,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 38.0) internal successors, (494), 13 states have internal predecessors, (494), 0 states have call successors, (0), 0 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:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:21:25,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:21:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:21:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:21:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:21:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:21:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:21:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:21:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:21:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:21:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-10 03:21:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:21:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:21:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-10 03:21:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:21:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:21:38,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:21:38,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:21:38,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-10 03:21:39,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:21:39,139 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:21:39,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:21:39,140 INFO L85 PathProgramCache]: Analyzing trace with hash -516085794, now seen corresponding path program 11 times [2022-11-10 03:21:39,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:21:39,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244113311] [2022-11-10 03:21:39,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:21:39,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:21:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:21:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 117 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:21:46,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:21:46,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244113311] [2022-11-10 03:21:46,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244113311] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:21:46,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858922107] [2022-11-10 03:21:46,206 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-10 03:21:46,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:21:46,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:21:46,213 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:21:46,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-10 03:21:46,693 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-10 03:21:46,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:21:46,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-10 03:21:46,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:21:46,855 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:21:46,856 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:21:47,321 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:21:47,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:47,364 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 14 treesize of output 16 [2022-11-10 03:21:47,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:47,377 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:21:47,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:47,429 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:21:47,441 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 23 treesize of output 23 [2022-11-10 03:21:47,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:47,972 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:21:47,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:47,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:47,986 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:21:48,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:48,063 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:21:48,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:48,081 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:21:48,104 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:21:48,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:48,927 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:21:48,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:48,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:48,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:48,954 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:21:49,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:49,059 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:21:49,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:49,079 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:21:49,094 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:21:50,071 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:21:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 151 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:21:50,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:21:50,336 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1688 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1688 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))) (forall ((v_ArrVal_1688 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1688 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1688) |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:21:50,355 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1688 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1688 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1688 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1688 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1688) |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:21:51,488 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1682 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1682))) (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_1687) |c_~#arr~0.base| v_ArrVal_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1682 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1682))) (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_1687) |c_~#arr~0.base| v_ArrVal_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1682 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1682))) (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_1687) |c_~#arr~0.base| v_ArrVal_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1682 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1682))) (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_1687) |c_~#arr~0.base| v_ArrVal_1688) |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:21:51,532 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1682 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1682))) (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_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1682 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1682))) (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_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1682 (Array Int Int))) (= 0 (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1682))) (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_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1682 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1682))) (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_1688) |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:21:52,105 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1681) |c_~#arr~0.base| v_ArrVal_1682))) (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_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int))) (= (select (select (store (let ((.cse2 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1681) |c_~#arr~0.base| v_ArrVal_1682))) (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_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int))) (= (select (select (store (let ((.cse3 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1681) |c_~#arr~0.base| v_ArrVal_1682))) (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_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1681) |c_~#arr~0.base| v_ArrVal_1682))) (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_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-10 03:21:52,147 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_1688 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1681) |c_~#arr~0.base| v_ArrVal_1682))) (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_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1681) |c_~#arr~0.base| v_ArrVal_1682))) (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_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int))) (= (select (select (store (let ((.cse5 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1681) |c_~#arr~0.base| v_ArrVal_1682))) (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_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1681) |c_~#arr~0.base| v_ArrVal_1682))) (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_1688) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-10 03:21:53,290 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:21:53,291 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 124 treesize of output 91 [2022-11-10 03:21:53,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:21:53,296 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 282 treesize of output 266 [2022-11-10 03:21:53,303 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 130 treesize of output 122 [2022-11-10 03:21:53,305 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 140 treesize of output 120 [2022-11-10 03:21:53,308 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 106 treesize of output 102 [2022-11-10 03:21:53,310 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 102 treesize of output 98 [2022-11-10 03:21:53,326 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-10 03:21:53,326 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 1 [2022-11-10 03:21:53,573 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:21:53,573 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:21:53,614 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 48 proven. 45 refuted. 16 times theorem prover too weak. 0 trivial. 161 not checked. [2022-11-10 03:21:53,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858922107] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:21:53,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:21:53,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 21, 22] total 73 [2022-11-10 03:21:53,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930773550] [2022-11-10 03:21:53,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:21:53,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-10 03:21:53,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:21:53,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-10 03:21:53,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=3848, Unknown=187, NotChecked=822, Total=5402 [2022-11-10 03:21:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:21:53,618 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:21:53,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 10.506849315068493) internal successors, (767), 74 states have internal predecessors, (767), 0 states have call successors, (0), 0 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:21:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:21:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:21:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:21:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:21:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:21:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:21:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:21:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:53,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:21:53,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-10 03:21:53,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:21:53,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:21:53,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-10 03:21:53,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:21:53,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:21:53,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:21:53,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:21:53,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:22:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-10 03:22:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:22:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-10 03:22:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:22:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:22:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:22:12,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-10 03:22:13,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:22:13,084 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:22:13,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:22:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1603329870, now seen corresponding path program 12 times [2022-11-10 03:22:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:22:13,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629580844] [2022-11-10 03:22:13,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:22:13,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:22:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:22:14,150 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:22:14,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:22:14,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629580844] [2022-11-10 03:22:14,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629580844] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:22:14,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743562914] [2022-11-10 03:22:14,151 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-10 03:22:14,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:22:14,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:22:14,152 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:22:14,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-10 03:22:14,306 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-10 03:22:14,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:22:14,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-10 03:22:14,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:22:14,385 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:22:14,385 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:22:14,650 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:22:14,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:22:14,685 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 14 treesize of output 16 [2022-11-10 03:22:14,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:22:14,696 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 14 treesize of output 16 [2022-11-10 03:22:14,708 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 14 treesize of output 16 [2022-11-10 03:22:15,077 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 14 treesize of output 16 [2022-11-10 03:22:15,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:22:15,105 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:22:15,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:22:15,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:22:15,142 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:22:15,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:22:15,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:22:15,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:22:15,183 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:22:15,223 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:22:15,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:22:15,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1770 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1770) |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:22:15,421 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1770 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1770) |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:22:15,540 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:22:15,540 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 1 case distinctions, treesize of input 21 treesize of output 22 [2022-11-10 03:22:15,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2022-11-10 03:22:15,545 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 90 treesize of output 82 [2022-11-10 03:22:15,548 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 43 treesize of output 39 [2022-11-10 03:22:15,745 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:22:15,746 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:22:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-10 03:22:15,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743562914] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:22:15,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:22:15,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 45 [2022-11-10 03:22:15,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222825382] [2022-11-10 03:22:15,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:22:15,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-10 03:22:15,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:22:15,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-10 03:22:15,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1631, Unknown=42, NotChecked=170, Total=2070 [2022-11-10 03:22:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:22:15,750 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:22:15,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 9.177777777777777) internal successors, (413), 46 states have internal predecessors, (413), 0 states have call successors, (0), 0 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:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-10 03:22:15,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.