/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-09 22:25:42,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-09 22:25:42,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-09 22:25:42,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-09 22:25:42,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-09 22:25:42,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-09 22:25:42,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-09 22:25:42,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-09 22:25:42,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-09 22:25:42,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-09 22:25:42,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-09 22:25:42,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-09 22:25:42,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-09 22:25:42,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-09 22:25:42,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-09 22:25:42,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-09 22:25:42,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-09 22:25:42,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-09 22:25:42,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-09 22:25:42,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-09 22:25:42,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-09 22:25:42,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-09 22:25:42,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-09 22:25:42,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-09 22:25:42,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-09 22:25:42,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-09 22:25:42,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-09 22:25:42,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-09 22:25:42,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-09 22:25:42,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-09 22:25:42,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-09 22:25:42,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-09 22:25:42,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-09 22:25:42,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-09 22:25:42,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-09 22:25:42,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-09 22:25:42,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-09 22:25:42,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-09 22:25:42,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-09 22:25:42,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-09 22:25:42,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-09 22:25:42,383 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-09 22:25:42,406 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-09 22:25:42,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-09 22:25:42,407 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-09 22:25:42,407 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-09 22:25:42,408 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-09 22:25:42,408 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-09 22:25:42,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-09 22:25:42,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-09 22:25:42,408 INFO L138 SettingsManager]: * Use SBE=true [2022-11-09 22:25:42,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-09 22:25:42,409 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-09 22:25:42,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-09 22:25:42,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-09 22:25:42,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-09 22:25:42,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-09 22:25:42,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-09 22:25:42,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-09 22:25:42,410 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-09 22:25:42,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-09 22:25:42,410 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-09 22:25:42,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-09 22:25:42,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-09 22:25:42,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-09 22:25:42,411 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-09 22:25:42,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-09 22:25:42,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 22:25:42,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-09 22:25:42,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-09 22:25:42,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-09 22:25:42,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-09 22:25:42,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-09 22:25:42,412 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-09 22:25:42,412 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-09 22:25:42,412 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-09 22:25:42,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-09 22:25:42,412 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-09 22:25:42,412 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-09 22:25:42,413 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-09 22:25:42,413 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-09 22:25:42,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-09 22:25:42,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-09 22:25:42,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-09 22:25:42,627 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-09 22:25:42,627 INFO L275 PluginConnector]: CDTParser initialized [2022-11-09 22:25:42,628 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-09 22:25:42,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9958c16a6/4c014878a9294470ab0015834d50d4a6/FLAGe91fdb7b3 [2022-11-09 22:25:43,116 INFO L306 CDTParser]: Found 1 translation units. [2022-11-09 22:25:43,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2022-11-09 22:25:43,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9958c16a6/4c014878a9294470ab0015834d50d4a6/FLAGe91fdb7b3 [2022-11-09 22:25:43,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9958c16a6/4c014878a9294470ab0015834d50d4a6 [2022-11-09 22:25:43,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-09 22:25:43,142 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-09 22:25:43,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-09 22:25:43,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-09 22:25:43,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-09 22:25:43,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:25:43" (1/1) ... [2022-11-09 22:25:43,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4defde47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:43, skipping insertion in model container [2022-11-09 22:25:43,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:25:43" (1/1) ... [2022-11-09 22:25:43,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-09 22:25:43,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-09 22:25:43,537 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-09 22:25:43,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 22:25:43,578 INFO L203 MainTranslator]: Completed pre-run [2022-11-09 22:25:43,607 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-09 22:25:43,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 22:25:43,672 INFO L208 MainTranslator]: Completed translation [2022-11-09 22:25:43,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:43 WrapperNode [2022-11-09 22:25:43,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-09 22:25:43,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-09 22:25:43,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-09 22:25:43,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-09 22:25:43,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:43" (1/1) ... [2022-11-09 22:25:43,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:43" (1/1) ... [2022-11-09 22:25:43,735 INFO L138 Inliner]: procedures = 277, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 198 [2022-11-09 22:25:43,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-09 22:25:43,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-09 22:25:43,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-09 22:25:43,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-09 22:25:43,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:43" (1/1) ... [2022-11-09 22:25:43,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:43" (1/1) ... [2022-11-09 22:25:43,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:43" (1/1) ... [2022-11-09 22:25:43,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:43" (1/1) ... [2022-11-09 22:25:43,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:43" (1/1) ... [2022-11-09 22:25:43,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:43" (1/1) ... [2022-11-09 22:25:43,773 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:43" (1/1) ... [2022-11-09 22:25:43,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:43" (1/1) ... [2022-11-09 22:25:43,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-09 22:25:43,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-09 22:25:43,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-09 22:25:43,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-09 22:25:43,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:43" (1/1) ... [2022-11-09 22:25:43,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 22:25:43,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:25:43,819 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-09 22:25:43,821 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-09 22:25:43,844 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-09 22:25:43,844 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-09 22:25:43,844 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-09 22:25:43,845 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-09 22:25:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-09 22:25:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-09 22:25:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-09 22:25:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-09 22:25:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-09 22:25:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-09 22:25:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-09 22:25:43,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-09 22:25:43,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-09 22:25:43,846 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-09 22:25:44,011 INFO L235 CfgBuilder]: Building ICFG [2022-11-09 22:25:44,013 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-09 22:25:44,375 INFO L276 CfgBuilder]: Performing block encoding [2022-11-09 22:25:44,382 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-09 22:25:44,383 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-09 22:25:44,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:25:44 BoogieIcfgContainer [2022-11-09 22:25:44,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-09 22:25:44,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-09 22:25:44,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-09 22:25:44,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-09 22:25:44,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:25:43" (1/3) ... [2022-11-09 22:25:44,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df7ad2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:25:44, skipping insertion in model container [2022-11-09 22:25:44,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:25:43" (2/3) ... [2022-11-09 22:25:44,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df7ad2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:25:44, skipping insertion in model container [2022-11-09 22:25:44,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:25:44" (3/3) ... [2022-11-09 22:25:44,394 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-11-09 22:25:44,399 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-09 22:25:44,407 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-09 22:25:44,408 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-11-09 22:25:44,408 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-09 22:25:44,513 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-09 22:25:44,553 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-09 22:25:44,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 22:25:44,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:25:44,555 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-09 22:25:44,558 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-09 22:25:44,580 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 22:25:44,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 22:25:44,604 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;@a277c1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 22:25:44,605 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 22:25:44,914 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:25:44,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:25:44,918 INFO L85 PathProgramCache]: Analyzing trace with hash 397146121, now seen corresponding path program 1 times [2022-11-09 22:25:44,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:25:44,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128479269] [2022-11-09 22:25:44,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:25:44,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:25:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:25:45,533 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-09 22:25:45,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:25:45,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128479269] [2022-11-09 22:25:45,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128479269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:25:45,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:25:45,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 22:25:45,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681304439] [2022-11-09 22:25:45,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:25:45,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 22:25:45,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:25:45,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 22:25:45,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 22:25:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:25:45,556 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:25:45,557 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-09 22:25:45,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:25:45,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:25:45,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-09 22:25:45,866 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:25:45,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:25:45,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1977112786, now seen corresponding path program 1 times [2022-11-09 22:25:45,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:25:45,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899642786] [2022-11-09 22:25:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:25:45,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:25:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:25:46,831 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-09 22:25:46,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:25:46,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899642786] [2022-11-09 22:25:46,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899642786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:25:46,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:25:46,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-09 22:25:46,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623338753] [2022-11-09 22:25:46,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:25:46,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-09 22:25:46,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:25:46,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-09 22:25:46,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-09 22:25:46,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:25:46,836 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:25:46,837 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-09 22:25:46,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:25:46,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:25:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:25:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:25:47,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-09 22:25:47,503 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:25:47,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:25:47,503 INFO L85 PathProgramCache]: Analyzing trace with hash -839480496, now seen corresponding path program 1 times [2022-11-09 22:25:47,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:25:47,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413234907] [2022-11-09 22:25:47,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:25:47,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:25:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:25:48,818 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-09 22:25:48,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:25:48,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413234907] [2022-11-09 22:25:48,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413234907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:25:48,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93927213] [2022-11-09 22:25:48,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:25:48,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:25:48,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:25:48,846 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-09 22:25:48,875 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-09 22:25:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:25:48,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:25:48,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:25:49,067 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:25:49,068 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-09 22:25:49,141 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-09 22:25:49,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:49,169 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-09 22:25:49,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:49,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:49,202 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-09 22:25:49,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:49,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:49,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:49,240 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-09 22:25:49,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:49,764 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-09 22:25:49,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:49,787 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-09 22:25:49,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:49,811 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-09 22:25:49,837 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-09 22:25:50,526 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-09 22:25:50,561 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-09 22:25:50,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:25:50,587 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-09 22:25:50,706 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-09 22:25:50,734 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-09 22:25:51,510 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-09 22:25:51,520 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-09 22:25:51,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:25:51,572 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-09 22:25:51,577 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:25:51,577 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-09 22:25:51,579 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-09 22:25:51,638 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:25:51,639 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-09 22:25:51,642 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-09 22:25:51,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93927213] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:25:51,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:25:51,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 39 [2022-11-09 22:25:51,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019349027] [2022-11-09 22:25:51,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:25:51,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-09 22:25:51,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:25:51,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-09 22:25:51,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=963, Unknown=33, NotChecked=350, Total=1560 [2022-11-09 22:25:51,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:25:51,646 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:25:51,646 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-09 22:25:51,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:25:51,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:25:51,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:25:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:25:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:25:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:25:53,885 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-09 22:25:54,084 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-09 22:25:54,084 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:25:54,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:25:54,085 INFO L85 PathProgramCache]: Analyzing trace with hash -298260674, now seen corresponding path program 2 times [2022-11-09 22:25:54,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:25:54,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159159771] [2022-11-09 22:25:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:25:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:25:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:25:54,710 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-09 22:25:54,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:25:54,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159159771] [2022-11-09 22:25:54,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159159771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:25:54,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:25:54,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-09 22:25:54,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645404912] [2022-11-09 22:25:54,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:25:54,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-09 22:25:54,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:25:54,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-09 22:25:54,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-11-09 22:25:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:25:54,713 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:25:54,713 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-09 22:25:54,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:25:54,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:25:54,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:25:54,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:25:56,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:25:56,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:25:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:25:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-09 22:25:56,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-09 22:25:56,099 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:25:56,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:25:56,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1040124260, now seen corresponding path program 2 times [2022-11-09 22:25:56,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:25:56,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724920284] [2022-11-09 22:25:56,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:25:56,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:25:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:25:57,126 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-09 22:25:57,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:25:57,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724920284] [2022-11-09 22:25:57,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724920284] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:25:57,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697766838] [2022-11-09 22:25:57,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-09 22:25:57,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:25:57,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:25:57,128 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-09 22:25:57,156 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-09 22:25:57,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 22:25:57,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:25:57,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:25:57,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:25:57,299 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:25:57,299 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-09 22:25:57,372 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-09 22:25:57,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:57,396 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-09 22:25:57,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:57,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:57,427 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-09 22:25:57,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:57,836 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-09 22:25:57,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:57,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:57,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:57,853 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-09 22:25:57,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:57,900 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-09 22:25:57,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:25:57,916 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-09 22:25:57,935 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-09 22:25:58,516 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-09 22:25:58,556 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-09 22:25:58,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:25:58,576 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-09 22:25:58,722 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-09 22:25:59,251 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-09 22:25:59,266 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-09 22:25:59,497 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-09 22:25:59,551 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-09 22:25:59,804 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-09 22:25:59,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:25:59,867 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-09 22:25:59,872 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:25:59,873 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-09 22:25:59,877 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-09 22:25:59,955 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:25:59,955 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-09 22:25:59,959 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-09 22:25:59,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697766838] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:25:59,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:25:59,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 42 [2022-11-09 22:25:59,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94803180] [2022-11-09 22:25:59,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:25:59,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-09 22:25:59,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:25:59,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-09 22:25:59,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1040, Unknown=43, NotChecked=518, Total=1806 [2022-11-09 22:25:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:25:59,963 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:25:59,964 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-09 22:25:59,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:25:59,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:25:59,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:25:59,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-09 22:25:59,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:02,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:02,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:02,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:02,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-09 22:26:02,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:26:02,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-09 22:26:02,451 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-09 22:26:02,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:02,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1993584203, now seen corresponding path program 1 times [2022-11-09 22:26:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:02,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37129667] [2022-11-09 22:26:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:02,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:03,055 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-09 22:26:03,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:03,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37129667] [2022-11-09 22:26:03,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37129667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:03,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:03,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-09 22:26:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67524085] [2022-11-09 22:26:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:03,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 22:26:03,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:03,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 22:26:03,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 22:26:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:03,059 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:03,059 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-09 22:26:03,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:03,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:03,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:03,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-09 22:26:03,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:26:03,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:03,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:03,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:03,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:03,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:03,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-09 22:26:03,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:03,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-09 22:26:03,948 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:03,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:03,948 INFO L85 PathProgramCache]: Analyzing trace with hash 49337106, now seen corresponding path program 3 times [2022-11-09 22:26:03,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:03,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069538313] [2022-11-09 22:26:03,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:03,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:04,347 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-09 22:26:04,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:04,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069538313] [2022-11-09 22:26:04,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069538313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:04,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:04,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-09 22:26:04,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700443309] [2022-11-09 22:26:04,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:04,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-09 22:26:04,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:04,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-09 22:26:04,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-09 22:26:04,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:04,350 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:04,351 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-09 22:26:04,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:04,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:04,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:04,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:04,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-09 22:26:04,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:04,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:05,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-09 22:26:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:05,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-09 22:26:05,312 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:05,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:05,312 INFO L85 PathProgramCache]: Analyzing trace with hash -818720654, now seen corresponding path program 4 times [2022-11-09 22:26:05,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:05,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787419418] [2022-11-09 22:26:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:05,601 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-09 22:26:05,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:05,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787419418] [2022-11-09 22:26:05,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787419418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:05,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:05,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-09 22:26:05,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102825195] [2022-11-09 22:26:05,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:05,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-09 22:26:05,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:05,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-09 22:26:05,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-09 22:26:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:05,604 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:05,604 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-09 22:26:05,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:05,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:05,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:05,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:05,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-09 22:26:05,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:05,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:05,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-09 22:26:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:06,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:06,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:06,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-09 22:26:06,613 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1485336891, now seen corresponding path program 1 times [2022-11-09 22:26:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:06,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841294534] [2022-11-09 22:26:06,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:06,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:06,879 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-09 22:26:06,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:06,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841294534] [2022-11-09 22:26:06,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841294534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:06,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:06,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-09 22:26:06,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106459585] [2022-11-09 22:26:06,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:06,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-09 22:26:06,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:06,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-09 22:26:06,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-09 22:26:06,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:06,882 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:06,882 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-09 22:26:06,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:06,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:06,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:06,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:06,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-09 22:26:06,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:06,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:06,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:06,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:07,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:07,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:07,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:26:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:07,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-09 22:26:07,753 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:07,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash -688283958, now seen corresponding path program 1 times [2022-11-09 22:26:07,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:07,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588459212] [2022-11-09 22:26:07,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:07,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:07,877 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-09 22:26:07,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:07,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588459212] [2022-11-09 22:26:07,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588459212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:07,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063443822] [2022-11-09 22:26:07,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:07,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:07,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:07,891 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-09 22:26:07,892 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-09 22:26:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:08,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-09 22:26:08,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:08,130 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-09 22:26:08,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:26:08,240 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-09 22:26:08,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063443822] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:26:08,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:26:08,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-09 22:26:08,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754176563] [2022-11-09 22:26:08,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:26:08,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-09 22:26:08,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:08,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-09 22:26:08,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-09 22:26:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:08,243 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:08,243 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-09 22:26:08,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:08,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:08,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:08,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:08,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:26:08,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:08,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:08,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:08,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:08,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:09,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:26:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:09,648 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-09 22:26:09,847 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-09 22:26:09,848 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:09,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:09,848 INFO L85 PathProgramCache]: Analyzing trace with hash -829653058, now seen corresponding path program 3 times [2022-11-09 22:26:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:09,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051155701] [2022-11-09 22:26:09,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:09,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:10,347 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-09 22:26:10,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:10,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051155701] [2022-11-09 22:26:10,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051155701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:10,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760327465] [2022-11-09 22:26:10,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-09 22:26:10,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:10,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:10,349 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-09 22:26:10,350 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-09 22:26:10,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-09 22:26:10,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:26:10,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-09 22:26:10,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:10,511 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:26:10,511 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-09 22:26:10,874 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-09 22:26:10,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:10,900 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-09 22:26:10,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:10,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:10,931 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-09 22:26:10,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:10,963 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-09 22:26:10,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:10,975 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-09 22:26:10,986 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-09 22:26:11,485 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-09 22:26:11,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:11,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:11,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:11,518 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-09 22:26:11,545 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-09 22:26:11,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:26:11,562 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-09 22:26:11,625 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-09 22:26:11,924 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-09 22:26:12,052 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:26:12,053 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-09 22:26:12,055 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-09 22:26:12,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760327465] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:26:12,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:26:12,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 32 [2022-11-09 22:26:12,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920465084] [2022-11-09 22:26:12,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:26:12,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-09 22:26:12,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:12,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-09 22:26:12,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=704, Unknown=21, NotChecked=174, Total=1056 [2022-11-09 22:26:12,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:12,057 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:12,058 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-09 22:26:12,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:12,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:12,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:12,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:12,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:26:12,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:12,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:12,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:12,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:12,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:12,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:26:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:14,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:14,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:26:14,051 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-09 22:26:14,251 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-09 22:26:14,252 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:14,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash 50568159, now seen corresponding path program 4 times [2022-11-09 22:26:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:14,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98936418] [2022-11-09 22:26:14,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:16,349 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-09 22:26:16,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:16,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98936418] [2022-11-09 22:26:16,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98936418] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:16,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461830351] [2022-11-09 22:26:16,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-09 22:26:16,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:16,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:16,351 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-09 22:26:16,352 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-09 22:26:16,544 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-09 22:26:16,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:26:16,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-09 22:26:16,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:16,688 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:26:16,688 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-09 22:26:17,093 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-09 22:26:17,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:17,145 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-09 22:26:17,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:17,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:17,201 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-09 22:26:17,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:17,260 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-09 22:26:17,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:17,287 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-09 22:26:17,304 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-09 22:26:18,302 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-09 22:26:18,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:18,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:18,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:18,325 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-09 22:26:18,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:18,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:18,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:18,388 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-09 22:26:18,432 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-09 22:26:18,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:26:18,646 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-09 22:26:18,722 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-09 22:26:18,772 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-09 22:26:18,983 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-09 22:26:19,235 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-09 22:26:20,172 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-09 22:26:20,223 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-09 22:26:20,544 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-09 22:26:20,678 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-09 22:26:20,718 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-09 22:26:20,737 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:26:20,737 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-09 22:26:20,743 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-09 22:26:20,749 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-09 22:26:20,756 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-09 22:26:20,767 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-09 22:26:20,808 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-09 22:26:20,809 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-09 22:26:20,814 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-09 22:26:20,815 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-09 22:26:20,821 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-09 22:26:20,821 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-09 22:26:20,999 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:26:20,999 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-09 22:26:21,022 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-09 22:26:21,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461830351] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:26:21,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:26:21,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 55 [2022-11-09 22:26:21,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429824650] [2022-11-09 22:26:21,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:26:21,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-09 22:26:21,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:21,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-09 22:26:21,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1825, Unknown=10, NotChecked=970, Total=3080 [2022-11-09 22:26:21,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:21,025 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:21,026 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-09 22:26:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:26:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:26:21,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:26:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:26:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:26:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-09 22:26:55,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-09 22:26:55,268 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-09 22:26:55,268 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1567622141, now seen corresponding path program 5 times [2022-11-09 22:26:55,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:55,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340087885] [2022-11-09 22:26:55,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:55,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:57,613 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-09 22:26:57,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:57,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340087885] [2022-11-09 22:26:57,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340087885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:57,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139538246] [2022-11-09 22:26:57,614 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-09 22:26:57,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:57,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:57,616 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-09 22:26:57,617 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-09 22:26:57,762 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 22:26:57,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:26:57,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-09 22:26:57,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:57,920 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:26:57,921 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-09 22:26:58,310 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-09 22:26:58,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:58,348 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-09 22:26:58,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:58,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:58,397 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-09 22:26:58,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:58,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 22:26:58,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:58,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-09 22:26:58,473 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-09 22:26:59,141 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-09 22:26:59,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:59,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:59,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:59,166 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-09 22:26:59,216 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-09 22:26:59,235 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-09 22:26:59,278 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-09 22:26:59,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:26:59,516 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|) (+ |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 ((.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| 1)) 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_~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|))))) is different from false [2022-11-09 22:26:59,633 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))) (= 0 (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|) (+ |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 ((.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|) 0)))) is different from false [2022-11-09 22:26:59,661 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|) (+ |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 ((.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|) 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| 1)) 0)))) is different from false [2022-11-09 22:27:02,487 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:02,487 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-09 22:27:02,494 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:02,494 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-09 22:27:02,501 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-09 22:27:02,504 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-09 22:27:02,508 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-09 22:27:02,530 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-09 22:27:02,531 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-09 22:27:02,759 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:27:02,760 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-09 22:27:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-09 22:27:02,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139538246] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:27:02,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:27:02,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 15] total 48 [2022-11-09 22:27:02,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40724567] [2022-11-09 22:27:02,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:27:02,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-09 22:27:02,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:27:02,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-09 22:27:02,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1721, Unknown=102, NotChecked=270, Total=2352 [2022-11-09 22:27:02,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:02,801 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:27:02,801 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-09 22:27:02,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:02,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:02,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:27:02,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:02,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:27:02,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:02,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:02,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:02,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:02,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:02,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:27:02,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-09 22:27:02,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:08,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:27:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:27:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:27:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-09 22:27:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:27:08,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-09 22:27:08,796 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-09 22:27:08,797 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:27:08,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:27:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1871568668, now seen corresponding path program 6 times [2022-11-09 22:27:08,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:27:08,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417449510] [2022-11-09 22:27:08,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:27:08,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:27:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:09,982 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-09 22:27:09,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:27:09,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417449510] [2022-11-09 22:27:09,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417449510] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:27:09,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158437857] [2022-11-09 22:27:09,982 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-09 22:27:09,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:27:09,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:27:09,983 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-09 22:27:09,984 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-09 22:27:10,228 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-09 22:27:10,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:27:10,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-09 22:27:10,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:27:10,395 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:27:10,395 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-09 22:27:10,850 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-09 22:27:10,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:10,890 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-09 22:27:10,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:10,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:10,935 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-09 22:27:10,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:10,983 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-09 22:27:11,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:11,012 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-09 22:27:11,028 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-09 22:27:11,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:11,945 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-09 22:27:11,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:11,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:11,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:11,977 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-09 22:27:12,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:12,048 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-09 22:27:12,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:12,078 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-09 22:27:12,100 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-09 22:27:13,328 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-09 22:27:13,384 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-09 22:27:13,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:27:13,406 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-09 22:27:13,515 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_984 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~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_#in~stack#1.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_t1Thread1of1ForFork0_push_#in~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_#in~stack#1.base| v_ArrVal_984) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-09 22:27:13,542 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-09 22:27:14,622 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-09 22:27:14,646 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-09 22:27:14,658 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-09 22:27:14,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:14,669 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-09 22:27:14,673 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:14,673 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-09 22:27:14,675 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-09 22:27:14,680 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-09 22:27:14,681 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-09 22:27:14,684 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-09 22:27:14,684 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-09 22:27:14,822 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:27:14,822 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-09 22:27:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 90 not checked. [2022-11-09 22:27:14,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158437857] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:27:14,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:27:14,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 17] total 43 [2022-11-09 22:27:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401562877] [2022-11-09 22:27:14,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:27:14,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-09 22:27:14,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:27:14,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-09 22:27:14,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1205, Unknown=6, NotChecked=462, Total=1892 [2022-11-09 22:27:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:14,830 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:27:14,830 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-09 22:27:14,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:14,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:14,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:27:14,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:14,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:27:14,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:14,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:14,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:14,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:14,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:14,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:27:14,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-09 22:27:14,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:27:14,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:27:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:27:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:27:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-09 22:27:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:27:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:27:21,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-09 22:27:21,708 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-09 22:27:21,709 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:27:21,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:27:21,709 INFO L85 PathProgramCache]: Analyzing trace with hash -386308020, now seen corresponding path program 7 times [2022-11-09 22:27:21,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:27:21,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950003646] [2022-11-09 22:27:21,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:27:21,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:27:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:26,264 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-09 22:27:26,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:27:26,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950003646] [2022-11-09 22:27:26,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950003646] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:27:26,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214909027] [2022-11-09 22:27:26,265 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-09 22:27:26,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:27:26,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:27:26,266 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-09 22:27:26,267 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-09 22:27:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:26,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-09 22:27:26,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:27:26,567 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:27:26,567 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-09 22:27:27,005 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-09 22:27:27,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:27,066 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-09 22:27:27,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:27,137 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-09 22:27:27,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:27,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:27,156 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-09 22:27:27,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:27,238 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-09 22:27:27,258 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-09 22:27:28,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:28,273 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-09 22:27:28,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:28,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:28,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:28,304 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-09 22:27:28,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:28,390 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-09 22:27:28,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:28,431 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-09 22:27:28,454 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-09 22:27:29,562 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-09 22:27:29,620 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-09 22:27:29,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:27:29,647 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-09 22:27:29,816 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-09 22:27:29,845 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-09 22:27:31,663 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-09 22:27:31,727 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-09 22:27:32,251 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-09 22:27:32,785 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse5 0) .cse3 0)))) (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 .cse2 |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|) .cse3) 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 .cse2 |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|) .cse5) 0)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1097 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1097) |c_~#arr~0.base| v_ArrVal_1098))) (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_1104) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1097 (Array Int Int))) (= (select (select (store (let ((.cse7 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1097) |c_~#arr~0.base| v_ArrVal_1098))) (store .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse7 |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))))) is different from false [2022-11-09 22:27:32,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:32,798 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 70 treesize of output 63 [2022-11-09 22:27:32,805 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:32,805 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 122 treesize of output 106 [2022-11-09 22:27:32,808 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 34 treesize of output 26 [2022-11-09 22:27:32,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:32,819 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 68 treesize of output 61 [2022-11-09 22:27:32,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-09 22:27:32,824 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:32,824 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 50 treesize of output 30 [2022-11-09 22:27:32,827 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-09 22:27:32,835 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-09 22:27:32,835 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-09 22:27:32,840 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-09 22:27:32,840 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-09 22:27:33,086 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:27:33,086 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-09 22:27:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 105 not checked. [2022-11-09 22:27:33,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214909027] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:27:33,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:27:33,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16, 18] total 58 [2022-11-09 22:27:33,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260203945] [2022-11-09 22:27:33,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:27:33,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-09 22:27:33,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:27:33,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-09 22:27:33,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=2198, Unknown=146, NotChecked=742, Total=3422 [2022-11-09 22:27:33,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:33,093 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:27:33,094 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-09 22:27:33,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:33,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:33,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:27:33,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:33,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:27:33,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:33,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:33,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:33,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:33,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:33,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:27:33,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-09 22:27:33,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:27:33,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:27:33,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:27:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:27:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:41,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:41,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:41,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:41,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:41,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:27:41,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:27:41,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:27:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:27:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:27:41,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-09 22:27:41,495 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-09 22:27:41,496 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:27:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:27:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash 46557120, now seen corresponding path program 8 times [2022-11-09 22:27:41,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:27:41,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79412313] [2022-11-09 22:27:41,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:27:41,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:27:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:42,939 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-09 22:27:42,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:27:42,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79412313] [2022-11-09 22:27:42,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79412313] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:27:42,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049344359] [2022-11-09 22:27:42,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-09 22:27:42,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:27:42,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:27:42,942 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-09 22:27:42,942 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-09 22:27:43,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 22:27:43,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:27:43,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-09 22:27:43,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:27:43,221 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:27:43,221 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-09 22:27:43,510 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-09 22:27:43,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:43,554 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-09 22:27:43,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:43,604 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-09 22:27:43,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27: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 23 treesize of output 23 [2022-11-09 22:27:43,626 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-09 22:27:44,221 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-09 22:27:44,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:44,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:44,280 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-09 22:27:44,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:44,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:44,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:44,483 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-09 22:27:44,521 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-09 22:27:44,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:27:44,537 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-09 22:27:44,641 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-09 22:27:44,835 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-09 22:27:44,841 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:44,842 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-09 22:27:44,846 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:44,846 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-09 22:27:44,851 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-09 22:27:44,856 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 82 treesize of output 78 [2022-11-09 22:27:44,878 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-09 22:27:44,878 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-09 22:27:45,093 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:27:45,094 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-09 22:27:45,097 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-09 22:27:45,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049344359] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:27:45,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:27:45,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 42 [2022-11-09 22:27:45,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264787298] [2022-11-09 22:27:45,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:27:45,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-09 22:27:45,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:27:45,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-09 22:27:45,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1341, Unknown=32, NotChecked=234, Total=1806 [2022-11-09 22:27:45,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:45,099 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:27:45,099 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-09 22:27:45,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:27:45,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:27:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:27:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:27:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:27:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:27:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:27:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:27:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:27:52,109 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-09 22:27:52,301 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-09 22:27:52,301 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:27:52,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:27:52,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1732532528, now seen corresponding path program 9 times [2022-11-09 22:27:52,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:27:52,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398826359] [2022-11-09 22:27:52,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:27:52,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:27:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:56,576 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-09 22:27:56,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:27:56,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398826359] [2022-11-09 22:27:56,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398826359] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:27:56,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263188708] [2022-11-09 22:27:56,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-09 22:27:56,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:27:56,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:27:56,578 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-09 22:27:56,579 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-09 22:27:56,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-09 22:27:56,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:27:56,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-09 22:27:56,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:27:57,170 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-11-09 22:27:57,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2022-11-09 22:27:58,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-09 22:27:58,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:58,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-09 22:27:58,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:58,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-09 22:27:58,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:58,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:58,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 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-09 22:27:58,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:58,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, 5 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-09 22:27:58,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-09 22:27:59,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:59,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-09 22:27:59,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:59,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:59,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:59,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 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-09 22:27:59,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:59,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-09 22:27:59,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:59,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-09 22:27:59,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:59,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-09 22:28:01,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-09 22:28:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 64 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:28:02,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:28:02,063 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)))) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-09 22:28:02,158 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-09 22:28:02,180 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1312 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-09 22:28:03,525 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1306))) (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_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1306))) (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_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1306))) (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_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)))) is different from false [2022-11-09 22:28:04,256 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.base_72| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (or (< |c_~#arr~0.base| |v_t1Thread1of1ForFork0_push_~stack#1.base_72|) (= (select (select (store (store (let ((.cse0 (store |c_#race| |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1306))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.base_72| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (or (< |c_~#arr~0.base| |v_t1Thread1of1ForFork0_push_~stack#1.base_72|) (= (select (select (store (store (let ((.cse2 (store |c_#race| |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1306))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.base_72| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (or (< |c_~#arr~0.base| |v_t1Thread1of1ForFork0_push_~stack#1.base_72|) (= (select (select (store (store (let ((.cse3 (store |c_#race| |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1306))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))))) is different from false [2022-11-09 22:28:05,158 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.base_72| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (or (= (select (select (store (store (let ((.cse0 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1305) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1306))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0) (< |c_~#arr~0.base| |v_t1Thread1of1ForFork0_push_~stack#1.base_72|))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.base_72| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (or (= (select (select (store (store (let ((.cse2 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1305) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1306))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0) (< |c_~#arr~0.base| |v_t1Thread1of1ForFork0_push_~stack#1.base_72|))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.base_72| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (or (< |c_~#arr~0.base| |v_t1Thread1of1ForFork0_push_~stack#1.base_72|) (= (select (select (store (store (let ((.cse3 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1305) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1306))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))))) is different from false [2022-11-09 22:28:05,203 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.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)))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.base_72| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (or (< |c_~#arr~0.base| |v_t1Thread1of1ForFork0_push_~stack#1.base_72|) (= (select (select (store (store (let ((.cse0 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1305) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1306))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.base_72| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (or (< |c_~#arr~0.base| |v_t1Thread1of1ForFork0_push_~stack#1.base_72|) (= (select (select (store (store (let ((.cse4 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1305) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1306))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.base_72| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (or (< |c_~#arr~0.base| |v_t1Thread1of1ForFork0_push_~stack#1.base_72|) (= 0 (select (select (store (store (let ((.cse5 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1305) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1306))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))))))) is different from false [2022-11-09 22:28:05,230 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) (.cse6 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse4 0) .cse6 0)))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.base_72| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (or (< |c_~#arr~0.base| |v_t1Thread1of1ForFork0_push_~stack#1.base_72|) (= (select (select (store (store (let ((.cse0 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1305) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1306))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.base_72| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (or (< |c_~#arr~0.base| |v_t1Thread1of1ForFork0_push_~stack#1.base_72|) (= (select (select (store (store (let ((.cse3 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1305) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1306))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse4) 0))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.base_72| Int) (v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1311 (Array Int Int))) (or (< |c_~#arr~0.base| |v_t1Thread1of1ForFork0_push_~stack#1.base_72|) (= (select (select (store (store (let ((.cse5 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1305) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1306))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |v_t1Thread1of1ForFork0_push_~stack#1.base_72| v_ArrVal_1311) |c_~#arr~0.base| v_ArrVal_1312) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse6) 0)))))) is different from false [2022-11-09 22:28:05,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:28:05,571 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 109 treesize of output 86 [2022-11-09 22:28:05,578 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 1142 treesize of output 1130 [2022-11-09 22:28:05,607 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 1110 treesize of output 1034 [2022-11-09 22:28:05,617 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 1034 treesize of output 996 [2022-11-09 22:28:05,626 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 996 treesize of output 990 [2022-11-09 22:28:05,637 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 990 treesize of output 966 [2022-11-09 22:28:05,649 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 622 treesize of output 618 [2022-11-09 22:28:06,572 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-11-09 22:28:06,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 33 [2022-11-09 22:28:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 0 refuted. 4 times theorem prover too weak. 0 trivial. 117 not checked. [2022-11-09 22:28:06,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263188708] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:28:06,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:28:06,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 23] total 67 [2022-11-09 22:28:06,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616354499] [2022-11-09 22:28:06,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:28:06,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-09 22:28:06,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:28:06,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-09 22:28:06,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=3108, Unknown=87, NotChecked=984, Total=4556 [2022-11-09 22:28:06,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:06,598 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:28:06,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 8.970149253731343) internal successors, (601), 68 states have internal predecessors, (601), 0 states have call successors, (0), 0 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-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:28:06,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:28:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:28:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:28:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:28:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:28:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:28:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:28:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:28:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:28:16,736 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-09 22:28:16,935 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-09 22:28:16,936 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:28:16,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:28:16,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2083033702, now seen corresponding path program 10 times [2022-11-09 22:28:16,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:28:16,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046200203] [2022-11-09 22:28:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:28:16,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:28:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:28:21,176 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-09 22:28:21,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:28:21,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046200203] [2022-11-09 22:28:21,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046200203] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:28:21,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241505755] [2022-11-09 22:28:21,177 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-09 22:28:21,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:28:21,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:28:21,178 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-09 22:28:21,179 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-09 22:28:21,524 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-09 22:28:21,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:28:21,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-09 22:28:21,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:28:21,664 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:28:21,665 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-09 22:28:22,017 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-09 22:28:22,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:22,053 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-09 22:28:22,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:22,060 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-09 22:28:22,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:22,099 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-09 22:28:22,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:22,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:22,111 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-09 22:28:22,157 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-09 22:28:22,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:22,715 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-09 22:28:22,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:22,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:22,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:22,734 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-09 22:28:22,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:22,787 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-09 22:28:22,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:22,806 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-09 22:28:22,822 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-09 22:28:23,506 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-09 22:28:23,553 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-09 22:28:23,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:28:23,571 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1432 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)))) (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-09 22:28:23,651 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1432 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))))) is different from false [2022-11-09 22:28:23,670 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1432 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-09 22:28:24,275 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1431 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1426))) (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_1431) |c_~#arr~0.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1431 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1426))) (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_1431) |c_~#arr~0.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1431 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1426))) (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_1431) |c_~#arr~0.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1431 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1426))) (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_1431) |c_~#arr~0.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)))) is different from false [2022-11-09 22:28:24,520 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1431 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1426))) (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_1431) |c_~#arr~0.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1431 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1426))) (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_1431) |c_~#arr~0.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1431 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1426))) (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_1431) |c_~#arr~0.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1431 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1426))) (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_1431) |c_~#arr~0.base| v_ArrVal_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)))) is different from false [2022-11-09 22:28:24,549 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1432 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1426))) (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_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1432 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1426))) (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_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1432 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1426))) (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_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1432 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1426))) (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_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)))) is different from false [2022-11-09 22:28:24,760 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1432 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425) |c_~#arr~0.base| v_ArrVal_1426))) (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_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1432 (Array Int Int))) (= (select (select (store (let ((.cse2 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425) |c_~#arr~0.base| v_ArrVal_1426))) (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_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1432 (Array Int Int))) (= (select (select (store (let ((.cse3 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425) |c_~#arr~0.base| v_ArrVal_1426))) (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_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1432 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425) |c_~#arr~0.base| v_ArrVal_1426))) (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_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-09 22:28:24,773 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.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)))) (and (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1432 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425) |c_~#arr~0.base| v_ArrVal_1426))) (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_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1432 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425) |c_~#arr~0.base| v_ArrVal_1426))) (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_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1432 (Array Int Int))) (= (select (select (store (let ((.cse5 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425) |c_~#arr~0.base| v_ArrVal_1426))) (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_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1432 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425) |c_~#arr~0.base| v_ArrVal_1426))) (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_1432) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))))) is different from false [2022-11-09 22:28:25,257 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:28:25,257 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-09 22:28:25,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:28:25,262 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-09 22:28:25,268 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 304 [2022-11-09 22:28:25,271 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 304 treesize of output 282 [2022-11-09 22:28:25,273 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 282 treesize of output 272 [2022-11-09 22:28:25,276 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-09 22:28:25,529 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:28:25,530 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-09 22:28:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 119 not checked. [2022-11-09 22:28:25,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241505755] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:28:25,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:28:25,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 19] total 61 [2022-11-09 22:28:25,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430812800] [2022-11-09 22:28:25,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:28:25,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-09 22:28:25,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:28:25,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-09 22:28:25,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=2422, Unknown=117, NotChecked=888, Total=3782 [2022-11-09 22:28:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:25,592 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:28:25,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 9.672131147540984) internal successors, (590), 62 states have internal predecessors, (590), 0 states have call successors, (0), 0 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-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:28:25,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:28:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:28:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:28:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:28:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:28:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:28:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:28:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:28:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:28:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:28:34,691 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-09 22:28:34,891 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-09 22:28:34,892 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:28:34,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:28:34,892 INFO L85 PathProgramCache]: Analyzing trace with hash -140688036, now seen corresponding path program 11 times [2022-11-09 22:28:34,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:28:34,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168963483] [2022-11-09 22:28:34,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:28:34,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:28:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:28:36,314 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-09 22:28:36,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:28:36,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168963483] [2022-11-09 22:28:36,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168963483] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:28:36,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913506861] [2022-11-09 22:28:36,315 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-09 22:28:36,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:28:36,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:28:36,316 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-09 22:28:36,317 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-09 22:28:36,458 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 22:28:36,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:28:36,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-09 22:28:36,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:28:36,547 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:28:36,547 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-09 22:28:36,848 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-09 22:28:36,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:36,889 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-09 22:28:36,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:36,905 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-09 22:28:36,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:36,950 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-09 22:28:36,962 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-09 22:28:37,531 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-09 22:28:37,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:37,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:37,570 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-09 22:28:37,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:37,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:37,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:37,616 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-09 22:28:37,660 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-09 22:28:37,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:28:37,683 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1516 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1516 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-09 22:28:37,742 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1516 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1516 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-09 22:28:37,758 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1516 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1516 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-09 22:28:42,039 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_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1515) |c_~#arr~0.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1515) |c_~#arr~0.base| v_ArrVal_1516) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))))) is different from false [2022-11-09 22:28:42,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:28:42,150 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-09 22:28:42,153 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 242 treesize of output 230 [2022-11-09 22:28:42,162 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 114 treesize of output 110 [2022-11-09 22:28:42,166 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 190 [2022-11-09 22:28:42,169 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 190 treesize of output 182 [2022-11-09 22:28:42,443 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:28:42,444 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-09 22:28:42,447 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-09 22:28:42,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913506861] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:28:42,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:28:42,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 15] total 43 [2022-11-09 22:28:42,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062653836] [2022-11-09 22:28:42,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:28:42,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-09 22:28:42,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:28:42,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-09 22:28:42,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1336, Unknown=30, NotChecked=316, Total=1892 [2022-11-09 22:28:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:42,449 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:28:42,449 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-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:28:42,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:28:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:28:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:28:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:28:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:28:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:28:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:28:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:28:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:28:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:28:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:28:51,942 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-09 22:28:52,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-09 22:28:52,140 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:28:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:28:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash 523878534, now seen corresponding path program 12 times [2022-11-09 22:28:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:28:52,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640187257] [2022-11-09 22:28:52,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:28:52,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:28:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:28:55,732 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-09 22:28:55,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:28:55,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640187257] [2022-11-09 22:28:55,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640187257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:28:55,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677599386] [2022-11-09 22:28:55,732 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-09 22:28:55,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:28:55,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:28:55,733 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-09 22:28:55,738 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-09 22:28:55,971 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-09 22:28:55,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:28:55,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-09 22:28:55,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:28:56,082 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:28:56,083 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-09 22:28:56,563 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-09 22:28:56,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:56,618 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-09 22:28:56,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:56,635 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-09 22:28:56,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:56,710 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-09 22:28:56,724 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-09 22:28:57,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:57,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-09 22:28:57,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:57,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:57,448 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-09 22:28:57,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:57,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:57,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:57,527 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-09 22:28:57,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:57,608 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-09 22:28:57,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:57,635 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-09 22:28:57,658 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-09 22:28:58,654 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-09 22:28:58,703 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-09 22:28:58,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:28:58,728 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1640 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1640) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1640 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1640) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1640 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1640) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1640 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1640) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-09 22:28:58,817 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1640 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1640) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1640 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1640) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1640 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1640) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1640 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1640) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-09 22:28:59,856 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) (.cse2 (+ |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|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1639 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1639) |c_~#arr~0.base| v_ArrVal_1640) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1639 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1639) |c_~#arr~0.base| v_ArrVal_1640) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1639 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1639) |c_~#arr~0.base| v_ArrVal_1640) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1639 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1639) |c_~#arr~0.base| v_ArrVal_1640) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0))))) is different from false [2022-11-09 22:29:01,585 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:29:01,586 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-09 22:29:01,590 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 482 treesize of output 470 [2022-11-09 22:29:01,599 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 450 treesize of output 418 [2022-11-09 22:29:01,608 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 218 treesize of output 214 [2022-11-09 22:29:01,612 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 414 treesize of output 406 [2022-11-09 22:29:01,617 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 406 treesize of output 390 [2022-11-09 22:29:02,022 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:29:02,022 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-09 22:29:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 47 proven. 0 refuted. 38 times theorem prover too weak. 0 trivial. 36 not checked. [2022-11-09 22:29:02,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677599386] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:29:02,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:29:02,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16, 19] total 58 [2022-11-09 22:29:02,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050620096] [2022-11-09 22:29:02,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:29:02,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-09 22:29:02,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:29:02,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-09 22:29:02,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=2540, Unknown=156, NotChecked=330, Total=3422 [2022-11-09 22:29:02,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:02,030 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:29:02,030 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-09 22:29:02,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:02,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:02,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:29:02,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:29:02,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:29:02,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:02,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:02,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:02,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:02,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:02,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:02,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:29:02,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:29:02,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:29:02,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:29:02,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:29:02,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:29:02,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:29:02,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:29:02,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:29:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:29:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:29:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:29:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:29:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:29:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:29:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:29:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:29:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:29:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:29:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:29:12,451 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-09 22:29:12,647 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-09 22:29:12,648 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:29:12,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:29:12,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1881011460, now seen corresponding path program 13 times [2022-11-09 22:29:12,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:29:12,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2695316] [2022-11-09 22:29:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:29:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:29:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:29:16,529 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-09 22:29:16,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:29:16,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2695316] [2022-11-09 22:29:16,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2695316] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:29:16,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753620775] [2022-11-09 22:29:16,529 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-09 22:29:16,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:29:16,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:29:16,531 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-09 22:29:16,531 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-09 22:29:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:29:16,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-09 22:29:16,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:29:16,814 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:29:16,815 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-09 22:29:17,159 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-09 22:29:17,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:17,206 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-09 22:29:17,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:17,235 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-09 22:29:17,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:17,296 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-09 22:29:17,313 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-09 22:29:18,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:18,002 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-09 22:29:18,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:18,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:18,020 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-09 22:29:18,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:18,082 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-09 22:29:18,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:18,099 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-09 22:29:18,113 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-09 22:29:19,125 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-09 22:29:19,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:19,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:19,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:19,185 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-09 22:29:19,235 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-09 22:29:19,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:29:19,257 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-09 22:29:19,324 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1758 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))))) is different from false [2022-11-09 22:29:19,340 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1758 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))) (forall ((v_ArrVal_1758 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-09 22:29:23,858 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_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1757) |c_~#arr~0.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1757) |c_~#arr~0.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1757) |c_~#arr~0.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:29:24,354 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1752 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1752))) (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_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1752 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1752))) (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_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1752 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1752))) (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_1758) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)))) is different from false [2022-11-09 22:29:25,216 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:29:25,217 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 96 treesize of output 73 [2022-11-09 22:29:25,220 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 482 treesize of output 470 [2022-11-09 22:29:25,230 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 234 treesize of output 230 [2022-11-09 22:29:25,234 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 446 treesize of output 414 [2022-11-09 22:29:25,236 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 414 treesize of output 398 [2022-11-09 22:29:25,239 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 398 treesize of output 390 [2022-11-09 22:29:25,513 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:29:25,513 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-09 22:29:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 20 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 100 not checked. [2022-11-09 22:29:25,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753620775] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:29:25,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:29:25,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16, 19] total 57 [2022-11-09 22:29:25,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687879718] [2022-11-09 22:29:25,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:29:25,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-09 22:29:25,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:29:25,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-09 22:29:25,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=2346, Unknown=94, NotChecked=530, Total=3306 [2022-11-09 22:29:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:25,518 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:29:25,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 10.31578947368421) internal successors, (588), 58 states have internal predecessors, (588), 0 states have call successors, (0), 0 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-09 22:29:25,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:25,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:25,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:29:25,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:29:25,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:29:25,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:25,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:25,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:25,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:25,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:25,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:25,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:29:25,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:29:25,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:29:25,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:29:25,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:29:25,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:29:25,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:29:25,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:29:25,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:29:25,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:29:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:29:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:29:38,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-09 22:29:38,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:29:38,368 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:29:38,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:29:38,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1603329870, now seen corresponding path program 14 times [2022-11-09 22:29:38,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:29:38,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250604573] [2022-11-09 22:29:38,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:29:38,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:29:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:29:39,407 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-09 22:29:39,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:29:39,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250604573] [2022-11-09 22:29:39,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250604573] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:29:39,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98455892] [2022-11-09 22:29:39,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-09 22:29:39,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:29:39,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:29:39,409 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 22:29:39,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-09 22:29:39,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 22:29:39,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:29:39,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-09 22:29:39,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:29:39,721 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:29:39,722 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-09 22:29:39,964 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-09 22:29:39,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:39,996 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-09 22:29:40,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:40,009 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-09 22:29:40,017 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-09 22:29:40,423 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-09 22:29:40,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:40,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, 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-09 22:29:40,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:40,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:40,515 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-09 22:29:40,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:40,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:40,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:40,573 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-09 22:29:40,626 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-09 22:29:40,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:29:40,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) is different from false [2022-11-09 22:29:40,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) is different from false [2022-11-09 22:29:41,044 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:29:41,044 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-09 22:29:41,046 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 60 treesize of output 52 [2022-11-09 22:29:41,048 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 40 treesize of output 36 [2022-11-09 22:29:41,051 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 22 treesize of output 20 [2022-11-09 22:29:41,270 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:29:41,270 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-09 22:29:41,273 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-09 22:29:41,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98455892] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:29:41,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:29:41,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 45 [2022-11-09 22:29:41,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042721519] [2022-11-09 22:29:41,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:29:41,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-09 22:29:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:29:41,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-09 22:29:41,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1630, Unknown=42, NotChecked=170, Total=2070 [2022-11-09 22:29:41,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:41,275 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:29:41,276 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-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:29:41,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:29:41,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:29:41,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:30:04,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:30:04,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:30:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:30:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-09 22:30:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:30:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:30:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:30:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-11-09 22:30:04,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-09 22:30:04,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-09 22:30:04,753 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:30:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:30:04,753 INFO L85 PathProgramCache]: Analyzing trace with hash -298832475, now seen corresponding path program 1 times [2022-11-09 22:30:04,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:30:04,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149706625] [2022-11-09 22:30:04,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:30:04,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:30:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:30:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-09 22:30:04,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:30:04,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149706625] [2022-11-09 22:30:04,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149706625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:30:04,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:30:04,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-09 22:30:04,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251053499] [2022-11-09 22:30:04,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:30:04,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 22:30:04,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:30:04,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 22:30:04,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 22:30:04,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:30:04,812 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:30:04,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-09 22:30:04,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:30:04,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:30:04,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:30:04,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:30:04,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:30:04,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 103 states. [2022-11-09 22:30:04,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:30:21,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:30:21,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:30:21,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:30:21,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:30:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-11-09 22:30:21,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:21,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-09 22:30:21,246 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:30:21,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:30:21,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1671088030, now seen corresponding path program 2 times [2022-11-09 22:30:21,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:30:21,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511131735] [2022-11-09 22:30:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:30:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:30:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:30:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-09 22:30:21,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:30:21,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511131735] [2022-11-09 22:30:21,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511131735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:30:21,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:30:21,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 22:30:21,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475820294] [2022-11-09 22:30:21,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:30:21,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-09 22:30:21,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:30:21,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-09 22:30:21,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-09 22:30:21,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:30:21,332 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:30:21,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 0 states have call successors, (0), 0 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-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-09 22:30:21,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-09 22:30:21,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:30:21,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:30:21,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:30:21,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 103 states. [2022-11-09 22:30:21,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:21,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.