/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_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-09 22:26:01,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-09 22:26:01,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-09 22:26:01,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-09 22:26:01,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-09 22:26:01,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-09 22:26:01,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-09 22:26:01,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-09 22:26:01,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-09 22:26:01,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-09 22:26:01,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-09 22:26:01,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-09 22:26:01,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-09 22:26:01,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-09 22:26:01,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-09 22:26:01,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-09 22:26:01,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-09 22:26:01,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-09 22:26:01,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-09 22:26:01,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-09 22:26:01,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-09 22:26:01,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-09 22:26:01,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-09 22:26:01,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-09 22:26:01,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-09 22:26:01,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-09 22:26:01,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-09 22:26:01,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-09 22:26:01,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-09 22:26:01,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-09 22:26:01,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-09 22:26:01,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-09 22:26:01,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-09 22:26:01,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-09 22:26:01,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-09 22:26:01,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-09 22:26:01,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-09 22:26:01,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-09 22:26:01,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-09 22:26:01,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-09 22:26:01,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-09 22:26:01,086 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:26:01,108 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-09 22:26:01,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-09 22:26:01,108 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-09 22:26:01,108 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-09 22:26:01,109 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-09 22:26:01,109 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-09 22:26:01,109 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-09 22:26:01,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-09 22:26:01,109 INFO L138 SettingsManager]: * Use SBE=true [2022-11-09 22:26:01,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-09 22:26:01,110 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-09 22:26:01,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-09 22:26:01,110 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-09 22:26:01,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-09 22:26:01,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-09 22:26:01,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-09 22:26:01,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-09 22:26:01,111 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-09 22:26:01,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-09 22:26:01,111 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-09 22:26:01,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-09 22:26:01,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-09 22:26:01,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-09 22:26:01,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-09 22:26:01,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-09 22:26:01,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 22:26:01,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-09 22:26:01,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-09 22:26:01,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-09 22:26:01,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-09 22:26:01,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-09 22:26:01,113 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-09 22:26:01,113 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-09 22:26:01,113 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-09 22:26:01,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-09 22:26:01,113 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-09 22:26:01,113 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-09 22:26:01,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-09 22:26:01,113 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:26:01,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-09 22:26:01,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-09 22:26:01,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-09 22:26:01,265 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-09 22:26:01,265 INFO L275 PluginConnector]: CDTParser initialized [2022-11-09 22:26:01,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2022-11-09 22:26:01,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f421c06/06700f5e584743d1b02e7ab3db2f6786/FLAGb76b453ce [2022-11-09 22:26:01,765 INFO L306 CDTParser]: Found 1 translation units. [2022-11-09 22:26:01,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2022-11-09 22:26:01,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f421c06/06700f5e584743d1b02e7ab3db2f6786/FLAGb76b453ce [2022-11-09 22:26:02,101 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f421c06/06700f5e584743d1b02e7ab3db2f6786 [2022-11-09 22:26:02,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-09 22:26:02,104 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-09 22:26:02,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-09 22:26:02,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-09 22:26:02,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-09 22:26:02,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:26:02" (1/1) ... [2022-11-09 22:26:02,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33de10df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:02, skipping insertion in model container [2022-11-09 22:26:02,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:26:02" (1/1) ... [2022-11-09 22:26:02,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-09 22:26:02,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-09 22:26:02,415 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_longest-2.i[41530,41543] [2022-11-09 22:26:02,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 22:26:02,456 INFO L203 MainTranslator]: Completed pre-run [2022-11-09 22:26:02,486 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_longest-2.i[41530,41543] [2022-11-09 22:26:02,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 22:26:02,554 INFO L208 MainTranslator]: Completed translation [2022-11-09 22:26:02,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:02 WrapperNode [2022-11-09 22:26:02,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-09 22:26:02,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-09 22:26:02,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-09 22:26:02,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-09 22:26:02,560 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:26:02" (1/1) ... [2022-11-09 22:26:02,585 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:26:02" (1/1) ... [2022-11-09 22:26:02,616 INFO L138 Inliner]: procedures = 277, calls = 40, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 194 [2022-11-09 22:26:02,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-09 22:26:02,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-09 22:26:02,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-09 22:26:02,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-09 22:26:02,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:02" (1/1) ... [2022-11-09 22:26:02,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:02" (1/1) ... [2022-11-09 22:26:02,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:02" (1/1) ... [2022-11-09 22:26:02,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:02" (1/1) ... [2022-11-09 22:26:02,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:02" (1/1) ... [2022-11-09 22:26:02,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:02" (1/1) ... [2022-11-09 22:26:02,650 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:02" (1/1) ... [2022-11-09 22:26:02,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:02" (1/1) ... [2022-11-09 22:26:02,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-09 22:26:02,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-09 22:26:02,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-09 22:26:02,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-09 22:26:02,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:02" (1/1) ... [2022-11-09 22:26:02,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 22:26:02,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:02,693 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:26:02,715 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:26:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-09 22:26:02,745 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-09 22:26:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-09 22:26:02,745 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-09 22:26:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-09 22:26:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-09 22:26:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-09 22:26:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-09 22:26:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-09 22:26:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-09 22:26:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-09 22:26:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-09 22:26:02,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-09 22:26:02,746 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:26:02,856 INFO L235 CfgBuilder]: Building ICFG [2022-11-09 22:26:02,857 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-09 22:26:03,106 INFO L276 CfgBuilder]: Performing block encoding [2022-11-09 22:26:03,113 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-09 22:26:03,113 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-09 22:26:03,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:26:03 BoogieIcfgContainer [2022-11-09 22:26:03,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-09 22:26:03,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-09 22:26:03,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-09 22:26:03,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-09 22:26:03,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:26:02" (1/3) ... [2022-11-09 22:26:03,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1953d191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:26:03, skipping insertion in model container [2022-11-09 22:26:03,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:02" (2/3) ... [2022-11-09 22:26:03,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1953d191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:26:03, skipping insertion in model container [2022-11-09 22:26:03,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:26:03" (3/3) ... [2022-11-09 22:26:03,120 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2022-11-09 22:26:03,126 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-09 22:26:03,131 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-09 22:26:03,132 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-11-09 22:26:03,132 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-09 22:26:03,238 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-09 22:26:03,276 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-09 22:26:03,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 22:26:03,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:03,295 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:26:03,303 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:26:03,336 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 22:26:03,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 22:26:03,357 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;@436eb265, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 22:26:03,357 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 22:26:03,679 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:03,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1113155676, now seen corresponding path program 1 times [2022-11-09 22:26:03,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:03,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338161189] [2022-11-09 22:26:03,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:03,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:04,329 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,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:04,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338161189] [2022-11-09 22:26:04,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338161189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:04,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:04,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 22:26:04,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488288391] [2022-11-09 22:26:04,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:04,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 22:26:04,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:04,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 22:26:04,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 22:26:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:04,363 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:04,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:04,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:04,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:04,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-09 22:26:04,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:04,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:04,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1674377527, now seen corresponding path program 1 times [2022-11-09 22:26:04,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:04,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144313556] [2022-11-09 22:26:04,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:04,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:05,936 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,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:05,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144313556] [2022-11-09 22:26:05,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144313556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:05,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:05,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-09 22:26:05,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013388421] [2022-11-09 22:26:05,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:05,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-09 22:26:05,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:05,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-09 22:26:05,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-09 22:26:05,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:05,941 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:05,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:05,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:05,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:06,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-09 22:26:06,738 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:06,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1252600405, now seen corresponding path program 1 times [2022-11-09 22:26:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:06,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102673024] [2022-11-09 22:26:06,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:06,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:08,078 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:26:08,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:08,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102673024] [2022-11-09 22:26:08,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102673024] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:08,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953132840] [2022-11-09 22:26:08,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:08,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:08,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:08,084 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:26:08,086 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:26:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:08,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:26:08,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:08,339 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:26:08,343 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:08,437 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:08,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:08,480 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:08,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:08,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:08,511 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:08,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:08,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:08,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:08,549 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:08,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:08,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 22:26:09,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:09,005 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:26:09,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:09,027 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:26:09,046 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:09,657 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:09,684 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:26:09,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:26:09,913 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_135 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_135 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_135 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_135 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_135) |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:26:09,934 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_135 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_135 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (forall ((v_ArrVal_135 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_135 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_135) |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:14,966 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_135 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_135 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_135 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_135) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_135 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_135) |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:15,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:26:15,181 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:26:15,187 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:26:15,187 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:26:15,191 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:26:15,272 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:26:15,272 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:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 3 not checked. [2022-11-09 22:26:15,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953132840] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:26:15,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:26:15,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 39 [2022-11-09 22:26:15,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163996323] [2022-11-09 22:26:15,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:26:15,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-09 22:26:15,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:15,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-09 22:26:15,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=1008, Unknown=46, NotChecked=216, Total=1560 [2022-11-09 22:26:15,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:15,281 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:15,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 8.743589743589743) internal successors, (341), 40 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:15,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:15,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:15,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-09 22:26:17,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-09 22:26:17,523 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:26:17,523 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:17,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:17,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1015781493, now seen corresponding path program 2 times [2022-11-09 22:26:17,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:17,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211859481] [2022-11-09 22:26:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:17,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:18,361 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:18,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:18,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211859481] [2022-11-09 22:26:18,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211859481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:18,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:18,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-09 22:26:18,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517530252] [2022-11-09 22:26:18,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:18,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-09 22:26:18,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:18,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-09 22:26:18,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-09 22:26:18,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:18,369 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:18,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:18,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:18,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:18,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-09 22:26:18,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-09 22:26:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-09 22:26:19,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-09 22:26:19,916 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:19,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1642850387, now seen corresponding path program 2 times [2022-11-09 22:26:19,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:19,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249006257] [2022-11-09 22:26:19,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:19,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:20,939 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:20,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:20,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249006257] [2022-11-09 22:26:20,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249006257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:20,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543813121] [2022-11-09 22:26:20,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-09 22:26:20,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:20,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:20,941 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:26:20,942 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:26:21,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 22:26:21,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:26:21,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:26:21,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:21,127 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:26:21,127 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:21,222 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:21,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:21,250 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:21,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:21,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:21,284 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:21,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:21,803 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:21,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:21,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:21,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:21,826 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:21,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:21,870 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:26:21,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:21,896 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:26:21,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:21,915 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:26:22,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:22,677 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:26:22,718 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:22,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:26:22,741 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_251 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_251 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_251 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_251 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_251) |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:23,228 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_250) |c_~#arr~0.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_250) |c_~#arr~0.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_250) |c_~#arr~0.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_250) |c_~#arr~0.base| v_ArrVal_251) |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:23,255 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_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_250) |c_~#arr~0.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_250) |c_~#arr~0.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_250) |c_~#arr~0.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_250) |c_~#arr~0.base| v_ArrVal_251) |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:23,271 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_245))) (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_250) |c_~#arr~0.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_245))) (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_250) |c_~#arr~0.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_245))) (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_250) |c_~#arr~0.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_245))) (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_250) |c_~#arr~0.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-09 22:26:23,407 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_245))) (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_250) |c_~#arr~0.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_245))) (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_250) |c_~#arr~0.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_245))) (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_250) |c_~#arr~0.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_245))) (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_250) |c_~#arr~0.base| v_ArrVal_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-09 22:26:23,434 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_245))) (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_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_245))) (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_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_245))) (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_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_~#arr~0.base| v_ArrVal_245))) (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_251) |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:23,608 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_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (let ((.cse0 (store .cse2 |c_~#arr~0.base| v_ArrVal_245))) (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_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (let ((.cse3 (store .cse2 |c_~#arr~0.base| v_ArrVal_245))) (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_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (let ((.cse4 (store .cse2 |c_~#arr~0.base| v_ArrVal_245))) (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_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_251 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (= (select (select (store (let ((.cse6 (store .cse2 |c_~#arr~0.base| v_ArrVal_245))) (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_251) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:26:23,684 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:26:23,685 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:23,692 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:26:23,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543813121] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:26:23,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:26:23,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 35 [2022-11-09 22:26:23,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016940798] [2022-11-09 22:26:23,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:26:23,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-09 22:26:23,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:23,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-09 22:26:23,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=629, Unknown=27, NotChecked=420, Total=1260 [2022-11-09 22:26:23,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:23,694 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:23,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 10.514285714285714) internal successors, (368), 36 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:23,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:23,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:23,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-09 22:26:23,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-09 22:26:23,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:26,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-09 22:26:26,968 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:26,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:26,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:26,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1511408695, now seen corresponding path program 3 times [2022-11-09 22:26:26,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:26,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126539686] [2022-11-09 22:26:26,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:26,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:27,448 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:27,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:27,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126539686] [2022-11-09 22:26:27,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126539686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:27,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:27,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-09 22:26:27,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260448235] [2022-11-09 22:26:27,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:27,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-09 22:26:27,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:27,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-09 22:26:27,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-09 22:26:27,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:27,450 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:27,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:27,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:27,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:27,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:27,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:27,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:27,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:30,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:26:30,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-09 22:26:30,237 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:30,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:30,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1073557543, now seen corresponding path program 3 times [2022-11-09 22:26:30,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:30,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706864989] [2022-11-09 22:26:30,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:30,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:31,074 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:31,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:31,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706864989] [2022-11-09 22:26:31,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706864989] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:31,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061144907] [2022-11-09 22:26:31,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-09 22:26:31,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:31,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:31,076 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:31,103 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:31,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-09 22:26:31,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:26:31,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:26:31,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:31,266 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:26:31,266 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:31,374 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:31,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:31,411 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:31,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:31,851 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:26:31,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:31,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:31,869 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:31,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:31,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:31,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:31,915 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:31,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:31,964 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:26:31,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:31,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, 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:26:32,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:32,006 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:26:32,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:32,883 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:26:32,942 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:32,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:26:32,957 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_367 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_367 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_367 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_367 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_367) |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:33,047 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_367 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_367 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_367 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_367 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_367) |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:33,065 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_367 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_367 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_367 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_367 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_367) |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:33,321 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_366) |c_~#arr~0.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_366) |c_~#arr~0.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_366) |c_~#arr~0.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_366) |c_~#arr~0.base| v_ArrVal_367) |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:33,351 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_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_366) |c_~#arr~0.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_366) |c_~#arr~0.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_366) |c_~#arr~0.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_366) |c_~#arr~0.base| v_ArrVal_367) |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:33,366 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_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_366) |c_~#arr~0.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_366) |c_~#arr~0.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_366) |c_~#arr~0.base| v_ArrVal_367) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_366 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_366) |c_~#arr~0.base| v_ArrVal_367) |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:33,908 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:26:33,908 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:33,912 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:26:33,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061144907] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:26:33,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:26:33,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 34 [2022-11-09 22:26:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245444060] [2022-11-09 22:26:33,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:26:33,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-09 22:26:33,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:33,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-09 22:26:33,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=637, Unknown=16, NotChecked=354, Total=1190 [2022-11-09 22:26:33,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:33,915 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:33,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 10.323529411764707) internal successors, (351), 35 states have internal predecessors, (351), 0 states have call successors, (0), 0 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:33,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:33,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:33,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:33,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:33,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:33,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:26:33,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:36,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:36,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:26:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:36,919 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:37,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:37,113 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:37,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:37,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1532648666, now seen corresponding path program 1 times [2022-11-09 22:26:37,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:37,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353737996] [2022-11-09 22:26:37,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:37,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-11-09 22:26:37,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:37,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353737996] [2022-11-09 22:26:37,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353737996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:37,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:37,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-09 22:26:37,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132503570] [2022-11-09 22:26:37,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:37,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 22:26:37,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:37,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 22:26:37,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 22:26:37,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:37,376 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:37,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:37,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:37,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:37,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:37,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:37,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:37,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:26:37,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:37,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:26:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:37,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-09 22:26:37,869 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:37,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash 768466356, now seen corresponding path program 1 times [2022-11-09 22:26:37,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:37,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327294754] [2022-11-09 22:26:37,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:37,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 60 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:26:37,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:37,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327294754] [2022-11-09 22:26:37,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327294754] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:37,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153642265] [2022-11-09 22:26:37,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:37,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:37,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:37,956 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:37,995 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:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:38,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-09 22:26:38,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-09 22:26:38,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-09 22:26:38,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153642265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:38,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-09 22:26:38,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-09 22:26:38,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231942837] [2022-11-09 22:26:38,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:38,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 22:26:38,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:38,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 22:26:38,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-09 22:26:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:38,111 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:38,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 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:38,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:38,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:38,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:38,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:38,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:38,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:26:38,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:38,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:38,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:26:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:38,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-09 22:26:38,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:38,695 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:38,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:38,695 INFO L85 PathProgramCache]: Analyzing trace with hash 491674951, now seen corresponding path program 1 times [2022-11-09 22:26:38,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:38,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739760311] [2022-11-09 22:26:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:38,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 60 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:26:38,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:38,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739760311] [2022-11-09 22:26:38,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739760311] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:38,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334076914] [2022-11-09 22:26:38,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:38,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:38,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:38,791 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:38,793 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:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:38,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-09 22:26:38,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-09 22:26:38,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-09 22:26:38,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334076914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:38,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-09 22:26:38,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-09 22:26:38,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092515882] [2022-11-09 22:26:38,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:38,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 22:26:38,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:38,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 22:26:38,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-09 22:26:38,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:38,949 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:38,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:38,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:38,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:38,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:38,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:38,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:38,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:26:38,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:38,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:38,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:38,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:39,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:26:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:39,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:39,472 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:39,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:39,670 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:39,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:39,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2121466519, now seen corresponding path program 1 times [2022-11-09 22:26:39,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:39,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772888594] [2022-11-09 22:26:39,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:39,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 60 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:26:39,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:39,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772888594] [2022-11-09 22:26:39,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772888594] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:39,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455212199] [2022-11-09 22:26:39,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:39,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:39,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:39,865 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:39,883 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:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:40,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-09 22:26:40,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 60 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:26:40,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:26:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 60 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:26:40,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455212199] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:26:40,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:26:40,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-09 22:26:40,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202040425] [2022-11-09 22:26:40,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:26:40,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-09 22:26:40,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:40,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-09 22:26:40,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-09 22:26:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:40,262 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:40,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 42.6) internal successors, (426), 10 states have internal predecessors, (426), 0 states have call successors, (0), 0 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:40,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:40,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:40,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:40,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:40,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:40,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:26:40,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:40,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:40,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:40,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:40,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:26:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:40,901 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:26:41,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:41,103 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:41,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:41,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1537197203, now seen corresponding path program 4 times [2022-11-09 22:26:41,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:41,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078145133] [2022-11-09 22:26:41,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:41,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:42,089 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:42,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:42,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078145133] [2022-11-09 22:26:42,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078145133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:42,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338292014] [2022-11-09 22:26:42,090 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-09 22:26:42,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:42,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:42,091 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:26:42,093 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:26:42,403 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-09 22:26:42,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:26:42,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:26:42,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:42,457 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:26:42,457 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:42,543 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:42,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:42,574 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:42,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:42,940 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:26:42,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:42,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:42,959 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:43,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:43,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, 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:43,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:43,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:43,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:43,033 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:43,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:43,073 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:26:43,090 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:43,698 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:43,731 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:43,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:26:43,747 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_849 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_849 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_849 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_849 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_849) |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:26:43,861 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_849 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))) (forall ((v_ArrVal_849 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_849 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_849 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_849) |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:43,883 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_849 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_849 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_849 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_849 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_849) |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:26:50,639 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_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_848) |c_~#arr~0.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_848) |c_~#arr~0.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_848) |c_~#arr~0.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (forall ((v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_848) |c_~#arr~0.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:26:50,652 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_844 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_844))) (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_848) |c_~#arr~0.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_844 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_844))) (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_848) |c_~#arr~0.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_844 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_844))) (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_848) |c_~#arr~0.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_844 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_844))) (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_848) |c_~#arr~0.base| v_ArrVal_849) |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:50,666 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_844 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_844))) (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_848) |c_~#arr~0.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_844 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_844))) (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_848) |c_~#arr~0.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_844 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_844))) (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_848) |c_~#arr~0.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_844 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_844))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_848) |c_~#arr~0.base| v_ArrVal_849) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:26:51,318 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:26:51,319 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 110 treesize of output 77 [2022-11-09 22:26:51,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:26:51,331 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 130 treesize of output 116 [2022-11-09 22:26:51,336 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 25 treesize of output 23 [2022-11-09 22:26:51,338 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 44 [2022-11-09 22:26:51,340 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:26:51,443 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:26:51,443 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:51,446 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:26:51,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338292014] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:26:51,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:26:51,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 38 [2022-11-09 22:26:51,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043790883] [2022-11-09 22:26:51,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:26:51,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-09 22:26:51,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:51,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-09 22:26:51,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=791, Unknown=42, NotChecked=402, Total=1482 [2022-11-09 22:26:51,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:51,449 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:51,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 10.105263157894736) internal successors, (384), 39 states have internal predecessors, (384), 0 states have call successors, (0), 0 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:51,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:51,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:51,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:51,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:51,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:51,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:26:51,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:51,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:51,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:51,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:51,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:51,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:26:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:26:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:26:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:26:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:26:54,997 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:26:55,197 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,SelfDestructingSolverStorable11 [2022-11-09 22:26:55,197 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:55,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:55,198 INFO L85 PathProgramCache]: Analyzing trace with hash 333598519, now seen corresponding path program 5 times [2022-11-09 22:26:55,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:55,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758780232] [2022-11-09 22:26:55,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:55,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:56,413 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:26:56,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:56,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758780232] [2022-11-09 22:26:56,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758780232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:56,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363581303] [2022-11-09 22:26:56,414 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-09 22:26:56,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:56,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:56,415 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:26:56,423 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:26:56,550 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 22:26:56,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:26:56,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-09 22:26:56,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:56,631 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:26:56,631 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:56,719 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:56,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:56,769 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:57,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:57,299 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:26:57,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:57,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:57,315 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:57,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:57,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-09 22:26:57,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:57,382 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:57,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:57,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:57,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:57,404 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:57,450 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:58,566 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:58,609 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:26:58,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:26:58,655 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_940) |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:58,760 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_940) |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:58,785 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_940) |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:05,509 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_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_939) |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_939) |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_939) |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_939) |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:27:05,523 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_936))) (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_939) |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_936))) (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_939) |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_936))) (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_939) |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_936))) (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_939) |c_~#arr~0.base| v_ArrVal_940) |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:05,580 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |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|) .cse4 0)))) (and (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_936))) (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_939) |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_936))) (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_939) |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_936))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_939) |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_936))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_939) |c_~#arr~0.base| v_ArrVal_940) |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:06,383 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:06,383 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 110 treesize of output 77 [2022-11-09 22:27:06,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:06,389 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 130 treesize of output 116 [2022-11-09 22:27:06,394 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 50 treesize of output 46 [2022-11-09 22:27:06,397 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:27:06,399 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 23 treesize of output 21 [2022-11-09 22:27:06,504 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:27:06,504 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:06,536 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:27:06,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363581303] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:27:06,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:27:06,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 40 [2022-11-09 22:27:06,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441345677] [2022-11-09 22:27:06,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:27:06,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-09 22:27:06,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:27:06,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-09 22:27:06,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=974, Unknown=26, NotChecked=426, Total=1640 [2022-11-09 22:27:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:06,539 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:27:06,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 7.85) internal successors, (314), 41 states have internal predecessors, (314), 0 states have call successors, (0), 0 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:06,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:06,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:06,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:06,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:06,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:06,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:27:06,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:06,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:06,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:06,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:06,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:06,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:27:06,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:09,128 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |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|) .cse4 0)))) (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_~#arr~0.base|)) (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_936))) (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_939) |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_936))) (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_939) |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_936))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_939) |c_~#arr~0.base| v_ArrVal_940) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (= 5 |c_~#arr~0.base|) (forall ((v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_940 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_936))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_939) |c_~#arr~0.base| v_ArrVal_940) |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:11,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:27:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:27:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:27:11,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-09 22:27:11,353 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,SelfDestructingSolverStorable12 [2022-11-09 22:27:11,353 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:27:11,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:27:11,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1793607127, now seen corresponding path program 6 times [2022-11-09 22:27:11,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:27:11,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689727624] [2022-11-09 22:27:11,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:27:11,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:27:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:12,222 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:12,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:27:12,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689727624] [2022-11-09 22:27:12,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689727624] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:27:12,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224989639] [2022-11-09 22:27:12,223 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-09 22:27:12,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:27:12,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:27:12,224 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:12,225 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:12,352 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-09 22:27:12,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:27:12,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:27:12,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:27:12,420 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:27:12,421 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:12,526 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:12,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:12,553 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:13,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:13,056 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:13,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:13,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:13,082 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:13,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:13,128 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:13,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:13,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-09 22:27:13,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:13,167 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:14,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:14,006 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:14,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:14,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:14,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:14,050 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:14,092 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:14,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:27:15,293 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:27:15,293 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:15,298 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:15,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224989639] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:27:15,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:27:15,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2022-11-09 22:27:15,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438721570] [2022-11-09 22:27:15,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:27:15,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-09 22:27:15,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:27:15,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-09 22:27:15,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2022-11-09 22:27:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:15,300 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:27:15,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 10.25925925925926) internal successors, (277), 28 states have internal predecessors, (277), 0 states have call successors, (0), 0 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:15,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:15,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:15,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:15,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:15,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:15,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:27:15,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:15,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:15,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:15,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:15,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:15,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:27:15,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-09 22:27:15,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:27:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:27:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:27:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:21,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-09 22:27:21,808 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,SelfDestructingSolverStorable13 [2022-11-09 22:27:21,808 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:27:21,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:27:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash 289417623, now seen corresponding path program 4 times [2022-11-09 22:27:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:27:21,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989740269] [2022-11-09 22:27:21,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:27:21,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:27:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:22,209 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:27:22,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:27:22,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989740269] [2022-11-09 22:27:22,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989740269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:27:22,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:27:22,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-09 22:27:22,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931563062] [2022-11-09 22:27:22,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:27:22,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-09 22:27:22,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:27:22,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-09 22:27:22,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-09 22:27:22,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:22,211 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:27:22,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:22,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:27:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:27:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:27:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:27:25,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-09 22:27:25,539 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:27:25,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:27:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash 999418187, now seen corresponding path program 7 times [2022-11-09 22:27:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:27:25,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577794858] [2022-11-09 22:27:25,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:27:25,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:27:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:26,135 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:26,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:27:26,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577794858] [2022-11-09 22:27:26,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577794858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:27:26,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493899865] [2022-11-09 22:27:26,135 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-09 22:27:26,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:27:26,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:27:26,137 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:26,137 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:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:26,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:27:26,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:27:26,304 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:27:26,304 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:26,376 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:26,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:26,648 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:27:26,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:26,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, 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:26,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:26,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:26,698 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:26,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:26,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:26,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:26,744 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:26,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:26,794 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:26,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:26,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:26,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:27:27,894 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:27,921 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:27,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:27:27,936 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1147) |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:28,019 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1147 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)))) (forall ((v_ArrVal_1147 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1147) |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:28,038 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1147) |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:28,294 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1146) |c_~#arr~0.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1146) |c_~#arr~0.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1146) |c_~#arr~0.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1146) |c_~#arr~0.base| v_ArrVal_1147) |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:28,328 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_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1146) |c_~#arr~0.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1146) |c_~#arr~0.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1146) |c_~#arr~0.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1146) |c_~#arr~0.base| v_ArrVal_1147) |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:28,339 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_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1146) |c_~#arr~0.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1146) |c_~#arr~0.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1146) |c_~#arr~0.base| v_ArrVal_1147) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1146) |c_~#arr~0.base| v_ArrVal_1147) |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:28,534 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:28,534 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:27:28,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:28,538 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:27:28,540 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:28,591 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:27:28,592 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:28,595 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:27:28,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493899865] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:27:28,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:27:28,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2022-11-09 22:27:28,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674715646] [2022-11-09 22:27:28,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:27:28,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-09 22:27:28,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:27:28,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-09 22:27:28,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=728, Unknown=6, NotChecked=378, Total=1332 [2022-11-09 22:27:28,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:28,598 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:27:28,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 10.666666666666666) internal successors, (384), 37 states have internal predecessors, (384), 0 states have call successors, (0), 0 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:28,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:27:28,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:27:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:31,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:27:31,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:27:31,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:31,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:27:31,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:27:31,869 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:27:32,069 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,SelfDestructingSolverStorable15 [2022-11-09 22:27:32,070 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:27:32,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:27:32,070 INFO L85 PathProgramCache]: Analyzing trace with hash -684794363, now seen corresponding path program 8 times [2022-11-09 22:27:32,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:27:32,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517754197] [2022-11-09 22:27:32,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:27:32,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:27:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:32,793 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:32,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:27:32,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517754197] [2022-11-09 22:27:32,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517754197] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:27:32,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988289761] [2022-11-09 22:27:32,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-09 22:27:32,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:27:32,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:27:32,795 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:27:32,796 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:27:32,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 22:27:32,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:27:32,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:27:32,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:27:32,982 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:27:32,982 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:33,060 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:33,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:33,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-09 22:27:33,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:33,350 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:33,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:33,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:33,387 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:33,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:33,430 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:33,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:33,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:33,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:33,447 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:33,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:33,492 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:33,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:33,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:34,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:34,498 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:34,535 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:34,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:27:34,552 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1238 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1238 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1238 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1238 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1238) |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:34,699 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1238 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1238 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1238 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1238 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1238) |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:47,459 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_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1237) |c_~#arr~0.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1237) |c_~#arr~0.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1237) |c_~#arr~0.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1237) |c_~#arr~0.base| v_ArrVal_1238) |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:47,620 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_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1233 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1233))) (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_1237) |c_~#arr~0.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1233 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1233))) (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_1237) |c_~#arr~0.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1233 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1233))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1237) |c_~#arr~0.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1233 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1233))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1237) |c_~#arr~0.base| v_ArrVal_1238) |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:47,907 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:27:47,907 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:47,912 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:47,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988289761] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:27:47,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:27:47,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 34 [2022-11-09 22:27:47,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626249002] [2022-11-09 22:27:47,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:27:47,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-09 22:27:47,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:27:47,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-09 22:27:47,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=712, Unknown=56, NotChecked=244, Total=1190 [2022-11-09 22:27:47,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:47,914 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:27:47,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 9.911764705882353) internal successors, (337), 35 states have internal predecessors, (337), 0 states have call successors, (0), 0 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:47,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:47,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:47,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:47,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:47,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:47,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:27:47,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:47,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:47,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:47,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:47,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:47,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:27:47,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:27:47,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:47,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:27:47,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:27:47,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:55,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:55,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:55,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:55,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:27:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:27:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:27:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:27:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:27:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:27:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:27:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:27:55,657 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:27:55,841 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,SelfDestructingSolverStorable16 [2022-11-09 22:27:55,842 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:27:55,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:27:55,842 INFO L85 PathProgramCache]: Analyzing trace with hash 246218840, now seen corresponding path program 9 times [2022-11-09 22:27:55,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:27:55,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423341076] [2022-11-09 22:27:55,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:27:55,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:27:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:56,728 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:27:56,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:27:56,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423341076] [2022-11-09 22:27:56,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423341076] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:27:56,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350851608] [2022-11-09 22:27:56,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-09 22:27:56,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:27:56,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:27:56,730 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:27:56,731 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:27:56,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-09 22:27:56,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:27:56,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-09 22:27:56,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:27:56,998 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-09 22:27:56,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-09 22:27:57,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-09 22:27:57,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:57,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-09 22:27:57,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:57,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-09 22:27:57,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:57,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:57,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-09 22:27:57,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:57,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-09 22:27:57,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:57,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:57,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:57,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-09 22:27:57,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:57,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 22:27:57,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:57,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 22:27:59,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:59,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 22:27:59,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:59,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 22:27:59,229 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:27:59,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:27:59,256 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1334 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1334 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1334 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1334 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1334) |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:59,403 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1334 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1334 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1334 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1334 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1334) |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:59,436 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1334 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1334 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1334 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1334 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1334) |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:59,792 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1332) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1332) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1332) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1332) |c_~#arr~0.base| v_ArrVal_1334) |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:59,819 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_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1332) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1332) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1332) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1332) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:27:59,835 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1328))) (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_1332) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1328))) (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_1332) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1328))) (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_1332) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1328))) (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_1332) |c_~#arr~0.base| v_ArrVal_1334) |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:59,855 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_1328 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1328))) (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_1332) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1328))) (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_1332) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1328))) (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_1332) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1332 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1328))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1332) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:28:00,221 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-09 22:28:00,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 19 [2022-11-09 22:28:00,239 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:28:00,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350851608] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:28:00,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:28:00,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 16] total 37 [2022-11-09 22:28:00,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880645399] [2022-11-09 22:28:00,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:28:00,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-09 22:28:00,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:28:00,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-09 22:28:00,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=761, Unknown=7, NotChecked=448, Total=1406 [2022-11-09 22:28:00,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:00,241 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:28:00,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 9.513513513513514) internal successors, (352), 38 states have internal predecessors, (352), 0 states have call successors, (0), 0 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:00,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:00,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:00,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:28:00,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:28:00,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:00,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:28:00,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:00,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:00,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:00,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:00,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:00,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:28:00,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:28:00,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:00,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:28:00,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:00,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:28:00,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:04,018 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:04,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-09 22:28:04,211 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:28:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:28:04,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1589365300, now seen corresponding path program 10 times [2022-11-09 22:28:04,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:28:04,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85542520] [2022-11-09 22:28:04,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:28:04,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:28:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:28:05,064 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:28:05,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:28:05,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85542520] [2022-11-09 22:28:05,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85542520] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:28:05,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420194448] [2022-11-09 22:28:05,064 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-09 22:28:05,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:28:05,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:28:05,066 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:05,067 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:05,332 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-09 22:28:05,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:28:05,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-09 22:28:05,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:28:05,392 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:28:05,393 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:05,481 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:05,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:05,818 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:05,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:05,834 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:05,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:05,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:05,877 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:05,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:05,931 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:05,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:05,949 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:05,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:05,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:05,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:05,971 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:06,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:06,018 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:06,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:06,898 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:06,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:06,919 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:06,956 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:28:06,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:28:06,973 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1430 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1430) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1430 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1430) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1430 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1430) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1430 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1430) |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:07,163 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1430 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1430) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1430 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1430) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1430 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1430) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1430 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1430) |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:21,966 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_1428 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1428) |c_~#arr~0.base| v_ArrVal_1430) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1428) |c_~#arr~0.base| v_ArrVal_1430) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1428) |c_~#arr~0.base| v_ArrVal_1430) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1428) |c_~#arr~0.base| v_ArrVal_1430) |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:21,981 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425))) (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_1428) |c_~#arr~0.base| v_ArrVal_1430) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425))) (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_1428) |c_~#arr~0.base| v_ArrVal_1430) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425))) (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_1428) |c_~#arr~0.base| v_ArrVal_1430) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425))) (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_1428) |c_~#arr~0.base| v_ArrVal_1430) |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:22,412 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:28:22,412 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:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 29 not checked. [2022-11-09 22:28:22,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420194448] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:28:22,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:28:22,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 34 [2022-11-09 22:28:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195429115] [2022-11-09 22:28:22,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:28:22,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-09 22:28:22,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:28:22,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-09 22:28:22,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=704, Unknown=63, NotChecked=244, Total=1190 [2022-11-09 22:28:22,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:22,419 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:28:22,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 10.0) internal successors, (340), 35 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:22,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:22,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:22,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:28:22,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:28:22,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:22,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:28:22,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:22,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:22,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:22,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:22,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:22,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:28:22,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:28:22,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:22,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:28:22,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:22,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:28:22,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:22,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:28:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:28:28,688 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:28:28,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:28:28,886 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:28:28,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:28:28,887 INFO L85 PathProgramCache]: Analyzing trace with hash 279368603, now seen corresponding path program 11 times [2022-11-09 22:28:28,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:28:28,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095867759] [2022-11-09 22:28:28,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:28:28,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:28:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:28:29,712 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:29,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:28:29,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095867759] [2022-11-09 22:28:29,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095867759] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:28:29,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683014603] [2022-11-09 22:28:29,713 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-09 22:28:29,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:28:29,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:28:29,714 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:28:29,716 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:28:29,861 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 22:28:29,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:28:29,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-09 22:28:29,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:28:29,989 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:28:29,989 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:30,098 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:30,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:30,482 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:30,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:30,494 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:30,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:30,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:30,530 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:30,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:30,571 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:30,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:30,586 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:30,597 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:31,120 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:31,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:31,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:31,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:31,160 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:31,194 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:31,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:28:31,210 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1519 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1519) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1519 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1519) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1519 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1519) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1))))) is different from false [2022-11-09 22:28:31,330 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1519 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1519) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1519 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1519) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1519 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1519) |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:42,376 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_1519 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1518) |c_~#arr~0.base| v_ArrVal_1519) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1518) |c_~#arr~0.base| v_ArrVal_1519) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1519 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1518) |c_~#arr~0.base| v_ArrVal_1519) |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:42,617 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:28:42,618 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,621 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:28:42,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683014603] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:28:42,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:28:42,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 14] total 37 [2022-11-09 22:28:42,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65874449] [2022-11-09 22:28:42,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:28:42,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-09 22:28:42,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:28:42,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-09 22:28:42,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=993, Unknown=31, NotChecked=204, Total=1406 [2022-11-09 22:28:42,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:42,624 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:28:42,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 9.513513513513514) internal successors, (352), 38 states have internal predecessors, (352), 0 states have call successors, (0), 0 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,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:42,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:42,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:28:42,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:28:42,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:42,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:28:42,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:42,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:42,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:42,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:42,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:42,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:28:42,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:28:42,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:42,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:28:42,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:42,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:28:42,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:42,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:28:42,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:28:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:28:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:28:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:28:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:28:47,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-09 22:28:47,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:28:47,973 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:28:47,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:28:47,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2121782073, now seen corresponding path program 12 times [2022-11-09 22:28:47,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:28:47,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062075521] [2022-11-09 22:28:47,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:28:47,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:28:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:28:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 37 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:28:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:28:49,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062075521] [2022-11-09 22:28:49,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062075521] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:28:49,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360830114] [2022-11-09 22:28:49,219 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-09 22:28:49,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:28:49,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:28:49,220 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:28:49,221 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:28:49,703 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-09 22:28:49,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:28:49,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-09 22:28:49,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:28:49,808 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-09 22:28:49,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-09 22:28:49,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-09 22:28:50,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:50,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:50,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:50,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-09 22:28:50,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:50,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:50,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-09 22:28:50,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:50,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-09 22:28:50,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:50,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-09 22:28:50,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:50,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-09 22:28:51,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:51,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-09 22:28:51,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:51,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:51,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:51,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-09 22:28:51,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:51,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 22:28:51,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:51,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 22:28:51,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:51,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 22:28:52,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:52,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 22:28:52,197 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:52,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:28:52,243 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1644 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1644 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1644 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (forall ((v_ArrVal_1644 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1644) |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:29:03,586 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_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1643) |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1643) |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1643) |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1643) |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:29:03,602 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1638))) (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_1643) |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1638))) (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_1643) |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1638))) (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_1643) |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1638))) (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_1643) |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-09 22:29:03,808 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1638))) (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_1643) |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1638))) (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_1643) |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1638))) (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_1643) |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1638))) (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_1643) |c_~#arr~0.base| v_ArrVal_1644) |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:03,973 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |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:29:04,274 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse2 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse3 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-09 22:29:04,301 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) (.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse5 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:29:04,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:29:04,615 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:29:04,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:29:04,619 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:29:04,622 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:29:04,739 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-09 22:29:04,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 19 [2022-11-09 22:29:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 3 refuted. 13 times theorem prover too weak. 0 trivial. 105 not checked. [2022-11-09 22:29:04,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360830114] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:29:04,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:29:04,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 19] total 54 [2022-11-09 22:29:04,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128105103] [2022-11-09 22:29:04,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:29:04,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-09 22:29:04,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:29:04,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-09 22:29:04,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1903, Unknown=88, NotChecked=686, Total=2970 [2022-11-09 22:29:04,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:04,770 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:29:04,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 10.648148148148149) internal successors, (575), 55 states have internal predecessors, (575), 0 states have call successors, (0), 0 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:04,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:04,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:04,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:29:04,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:29:04,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:04,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:29:04,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:04,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:04,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:04,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:04,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:04,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:29:04,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:29:04,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:04,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:29:04,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:04,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:04,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:04,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:04,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:29:04,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:05,662 WARN L833 $PredicateComparison]: unable to prove that (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|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2) 0)))) (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store .cse2 |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse3 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (or (= 5 |c_~#arr~0.base|) (= 6 |c_~#arr~0.base|)) (not (= (select |c_#valid| |c_~#arr~0.base|) 0)))) is different from false [2022-11-09 22:29:05,846 WARN L833 $PredicateComparison]: unable to prove that (and (= c_~top~0 0) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2) 0)) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3) 0))) |c_~#arr~0.base| v_ArrVal_1644) |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:05,861 WARN L833 $PredicateComparison]: unable to prove that (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|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2) 0)))) (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store .cse2 |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse3 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |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:13,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:29:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-09 22:29:13,040 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:29:13,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:29:13,240 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:29:13,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:29:13,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1417392925, now seen corresponding path program 13 times [2022-11-09 22:29:13,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:29:13,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795593738] [2022-11-09 22:29:13,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:29:13,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:29:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:29:13,802 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:13,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:29:13,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795593738] [2022-11-09 22:29:13,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795593738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:29:13,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53804453] [2022-11-09 22:29:13,802 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-09 22:29:13,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:29:13,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:29:13,804 INFO L229 MonitoredProcess]: Starting monitored process 18 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:13,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-09 22:29:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:29:13,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:29:13,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:29:14,009 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:29:14,009 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:14,099 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:14,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:14,426 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:14,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:14,443 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:14,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:14,483 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:14,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:14,493 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:14,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:14,511 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:15,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:15,109 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:15,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:15,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:15,149 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:15,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:15,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:15,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:15,197 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:15,234 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:15,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:29:15,639 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_~#arr~0.base|)) (forall ((v_ArrVal_1730 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1730) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1730 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1730) |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:15,994 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:29:15,995 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:15,999 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:16,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53804453] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:29:16,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:29:16,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 29 [2022-11-09 22:29:16,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001690577] [2022-11-09 22:29:16,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:29:16,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-09 22:29:16,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:29:16,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-09 22:29:16,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=654, Unknown=19, NotChecked=54, Total=870 [2022-11-09 22:29:16,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:16,003 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:29:16,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 9.689655172413794) internal successors, (281), 30 states have internal predecessors, (281), 0 states have call successors, (0), 0 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:16,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:16,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:16,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:29:16,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:29:16,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:16,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:29:16,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:16,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:16,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:16,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:29:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:29:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:29:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 22:29:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-09 22:29:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:23,085 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_~#arr~0.base|)) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse2 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse3 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-09 22:29:24,382 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (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) .cse3 0)) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1644 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1644 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3))) (forall ((v_ArrVal_1644 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1644 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-09 22:29:24,391 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.cse2 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (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) .cse3 0)) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (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_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1644 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1644 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1644 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (forall ((v_ArrVal_1644 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0)))) is different from false [2022-11-09 22:29:24,577 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.cse2 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (and (forall ((v_ArrVal_1644 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (= (select (select (store (let ((.cse1 (store (store (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) .cse3 0)) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1637) |c_~#arr~0.base| v_ArrVal_1638))) (store .cse1 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse0 0))) |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1644 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1644 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1644 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0)))) is different from false [2022-11-09 22:29:28,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:28,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:28,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-09 22:29:28,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:29:28,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-09 22:29:28,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-09 22:29:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-11-09 22:29:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:28,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-09 22:29:28,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:29:28,992 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:29:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:29:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1391916630, now seen corresponding path program 1 times [2022-11-09 22:29:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:29:28,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947618035] [2022-11-09 22:29:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:29:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:29:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:29:29,228 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:29:29,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:29:29,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947618035] [2022-11-09 22:29:29,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947618035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:29:29,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:29:29,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-09 22:29:29,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676928530] [2022-11-09 22:29:29,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:29:29,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-09 22:29:29,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:29:29,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-09 22:29:29,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-09 22:29:29,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:29,230 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:29:29,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.545454545454546) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:29,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:29,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:29,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-09 22:29:29,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:29:29,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-09 22:29:29,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:29:29,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:29,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:41,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-09 22:29:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-09 22:29:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:41,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-09 22:29:41,299 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:29:41,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:29:41,300 INFO L85 PathProgramCache]: Analyzing trace with hash -261922497, now seen corresponding path program 14 times [2022-11-09 22:29:41,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:29:41,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116722473] [2022-11-09 22:29:41,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:29:41,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:29:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:29:43,068 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:43,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:29:43,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116722473] [2022-11-09 22:29:43,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116722473] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:29:43,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95358147] [2022-11-09 22:29:43,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-09 22:29:43,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:29:43,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:29:43,070 INFO L229 MonitoredProcess]: Starting monitored process 19 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:43,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-09 22:29:43,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 22:29:43,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:29:43,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-09 22:29:43,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:29:43,307 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:29:43,308 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:43,502 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:43,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:43,529 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:43,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:43,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:43,561 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:43,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:43,599 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:43,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:43,610 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:43,628 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:44,055 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:44,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:44,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:44,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:44,088 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:44,119 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:44,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:29:44,171 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1850 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1850) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1850 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1850) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1850 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1850) |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:44,220 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1850 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1850) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1850 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1850) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1850 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1850) |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:29:44,232 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1850 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1850) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1850 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1850) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1850 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1850) |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:44,355 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1850 (Array Int Int)) (v_ArrVal_1849 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1849) |c_~#arr~0.base| v_ArrVal_1850) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1850 (Array Int Int)) (v_ArrVal_1849 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1849) |c_~#arr~0.base| v_ArrVal_1850) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1850 (Array Int Int)) (v_ArrVal_1849 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1849) |c_~#arr~0.base| v_ArrVal_1850) |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:44,370 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_1850 (Array Int Int)) (v_ArrVal_1849 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1849) |c_~#arr~0.base| v_ArrVal_1850) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1850 (Array Int Int)) (v_ArrVal_1849 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1849) |c_~#arr~0.base| v_ArrVal_1850) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1850 (Array Int Int)) (v_ArrVal_1849 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1849) |c_~#arr~0.base| v_ArrVal_1850) |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:44,534 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:29:44,534 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 31 treesize of output 42 [2022-11-09 22:29:44,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:29:44,537 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:29:44,540 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 24 treesize of output 22 [2022-11-09 22:29:44,541 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 38 treesize of output 34 [2022-11-09 22:29:44,706 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:29:44,707 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:44,709 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:29:44,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95358147] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:29:44,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:29:44,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 45 [2022-11-09 22:29:44,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734688283] [2022-11-09 22:29:44,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:29:44,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-09 22:29:44,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:29:44,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-09 22:29:44,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1422, Unknown=37, NotChecked=410, Total=2070 [2022-11-09 22:29:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:44,711 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:29:44,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 8.911111111111111) internal successors, (401), 46 states have internal predecessors, (401), 0 states have call successors, (0), 0 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:44,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:44,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:29:44,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-09 22:29:44,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:29:44,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-09 22:29:44,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:29:44,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:44,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:44,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:44,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:44,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:44,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:29:44,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:29:44,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:44,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:29:44,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:44,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:44,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:29:44,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:44,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-09 22:29:44,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-09 22:29:44,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:44,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:29:44,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:30:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:30:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:30:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:30:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:30:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-09 22:30:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-09 22:30:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:30:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-09 22:30:01,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-09 22:30:01,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:30:01,763 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:30:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:30:01,763 INFO L85 PathProgramCache]: Analyzing trace with hash 470344798, now seen corresponding path program 15 times [2022-11-09 22:30:01,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:30:01,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618543657] [2022-11-09 22:30:01,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:30:01,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:30:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:30:03,817 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:30:03,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:30:03,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618543657] [2022-11-09 22:30:03,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618543657] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:30:03,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817116026] [2022-11-09 22:30:03,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-09 22:30:03,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:30:03,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:30:03,819 INFO L229 MonitoredProcess]: Starting monitored process 20 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:30:03,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-09 22:30:03,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-09 22:30:03,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:30:03,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-09 22:30:03,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:30:04,272 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-11-09 22:30:04,272 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:30:05,027 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:30:05,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:05,080 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:30:05,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:05,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:05,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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:30:05,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:05,223 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:30:05,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:05,248 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:30:05,264 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:30:06,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:30:06,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:06,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:06,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:06,521 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:30:06,596 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:30:06,641 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:30:06,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:30:06,756 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_1947 (Array Int Int))) (= (select (select (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1947 (Array Int Int))) (= (select (select (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1947 (Array Int Int))) (= (select (select (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1947 (Array Int Int))) (= (select (select (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1947) |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:30:06,766 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1944))) (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_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1944))) (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_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1944))) (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_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1944))) (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_1947) |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:30:06,857 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1944))) (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_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1944))) (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_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1944))) (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_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1944))) (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_1947) |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:30:06,879 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1944))) (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_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1944))) (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_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1944))) (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_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1944))) (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_1947) |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:30:07,156 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1943) |c_~#arr~0.base| v_ArrVal_1944))) (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_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse2 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1943) |c_~#arr~0.base| v_ArrVal_1944))) (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_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse3 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1943) |c_~#arr~0.base| v_ArrVal_1944))) (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_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1943) |c_~#arr~0.base| v_ArrVal_1944))) (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_1947) |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:30:07,367 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1))) (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|) .cse3 0) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2) 0)))) (and (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1943) |c_~#arr~0.base| v_ArrVal_1944))) (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_1947) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1943) |c_~#arr~0.base| v_ArrVal_1944))) (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_1947) |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:30:07,379 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:30:07,380 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:30:07,383 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:30:07,384 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:30:07,387 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 70 treesize of output 64 [2022-11-09 22:30:07,392 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 50 treesize of output 48 [2022-11-09 22:30:07,394 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:30:07,406 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-09 22:30:07,406 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:30:07,588 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:30:07,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817116026] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:30:07,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:30:07,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 15] total 50 [2022-11-09 22:30:07,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309930953] [2022-11-09 22:30:07,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:30:07,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-09 22:30:07,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:30:07,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-09 22:30:07,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1712, Unknown=53, NotChecked=546, Total=2550 [2022-11-09 22:30:07,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:30:07,590 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:30:07,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 8.24) internal successors, (412), 51 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:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-09 22:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-09 22:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:30:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:30:07,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:30:07,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:30:07,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:30:07,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:30:07,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-09 22:30:07,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-09 22:30:07,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:30:07,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:07,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-09 22:30:07,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:30:21,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:30:21,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:30:21,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-09 22:30:21,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-09 22:30:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-09 22:30:21,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:30:21,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:21,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-09 22:30:21,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:30:21,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-09 22:30:21,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:30:21,420 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:30:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:30:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash 294978135, now seen corresponding path program 16 times [2022-11-09 22:30:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:30:21,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144013905] [2022-11-09 22:30:21,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:30:21,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:30:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:30:23,198 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:30:23,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:30:23,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144013905] [2022-11-09 22:30:23,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144013905] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:30:23,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875010426] [2022-11-09 22:30:23,198 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-09 22:30:23,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:30:23,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:30:23,200 INFO L229 MonitoredProcess]: Starting monitored process 21 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:30:23,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-09 22:30:23,411 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-09 22:30:23,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:30:23,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-09 22:30:23,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:30:23,497 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:30:23,498 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:30:23,811 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:30:23,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:23,841 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:30:23,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:23,872 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:30:23,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:23,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:23,883 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:30:23,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:23,919 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:30:23,930 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:30:24,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, 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:30:24,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:24,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:24,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:30:24,435 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:30:24,478 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:30:24,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:30:24,497 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2035 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2035 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2035 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2035) |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:30:24,555 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2035 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2035 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2035 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2035) |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:30:24,567 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2035 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))) (forall ((v_ArrVal_2035 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2035 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_2035) |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:30:37,636 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_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2034) |c_~#arr~0.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2034) |c_~#arr~0.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2034) |c_~#arr~0.base| v_ArrVal_2035) |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:30:37,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:30:37,904 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 55 treesize of output 48 [2022-11-09 22:30:37,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:30:37,911 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 190 treesize of output 176 [2022-11-09 22:30:37,919 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:30:37,922 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 156 treesize of output 144 [2022-11-09 22:30:37,924 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 144 treesize of output 138 [2022-11-09 22:30:38,173 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:30:38,174 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:30:38,201 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:30:38,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875010426] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:30:38,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:30:38,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 15] total 48 [2022-11-09 22:30:38,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930542931] [2022-11-09 22:30:38,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:30:38,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-09 22:30:38,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:30:38,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-09 22:30:38,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1685, Unknown=46, NotChecked=356, Total=2352 [2022-11-09 22:30:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:30:38,204 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:30:38,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 8.333333333333334) internal successors, (400), 49 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:30:38,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 22:30:38,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:30:38,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:30:38,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 22:30:38,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:30:38,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-09 22:30:38,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-09 22:30:38,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:30:38,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-09 22:30:38,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-09 22:30:38,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:30:38,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:30:50,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-09 22:30:50,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-09 22:30:50,389 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at most one deprecated predicate at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:153) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at java.base/java.util.Iterator.forEachRemaining(Iterator.java:133) at java.base/java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEachOrdered(ReferencePipeline.java:502) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:236) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.automata.partialorder.PersistentSetReduction.applyNewStateReduction(PersistentSetReduction.java:73) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-09 22:30:50,392 INFO L158 Benchmark]: Toolchain (without parser) took 288288.52ms. Allocated memory was 228.6MB in the beginning and 7.5GB in the end (delta: 7.2GB). Free memory was 199.8MB in the beginning and 5.1GB in the end (delta: -4.9GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-11-09 22:30:50,393 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 228.6MB. Free memory was 187.0MB in the beginning and 187.0MB in the end (delta: 70.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-11-09 22:30:50,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.28ms. Allocated memory is still 228.6MB. Free memory was 199.6MB in the beginning and 180.5MB in the end (delta: 19.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-11-09 22:30:50,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.47ms. Allocated memory is still 228.6MB. Free memory was 180.5MB in the beginning and 177.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-09 22:30:50,393 INFO L158 Benchmark]: Boogie Preprocessor took 46.41ms. Allocated memory is still 228.6MB. Free memory was 177.3MB in the beginning and 175.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-09 22:30:50,393 INFO L158 Benchmark]: RCFGBuilder took 450.34ms. Allocated memory is still 228.6MB. Free memory was 175.2MB in the beginning and 153.7MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-11-09 22:30:50,393 INFO L158 Benchmark]: TraceAbstraction took 287276.14ms. Allocated memory was 228.6MB in the beginning and 7.5GB in the end (delta: 7.2GB). Free memory was 153.1MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-11-09 22:30:50,394 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 228.6MB. Free memory was 187.0MB in the beginning and 187.0MB in the end (delta: 70.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 448.28ms. Allocated memory is still 228.6MB. Free memory was 199.6MB in the beginning and 180.5MB in the end (delta: 19.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.47ms. Allocated memory is still 228.6MB. Free memory was 180.5MB in the beginning and 177.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.41ms. Allocated memory is still 228.6MB. Free memory was 177.3MB in the beginning and 175.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 450.34ms. Allocated memory is still 228.6MB. Free memory was 175.2MB in the beginning and 153.7MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 287276.14ms. Allocated memory was 228.6MB in the beginning and 7.5GB in the end (delta: 7.2GB). Free memory was 153.1MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at most one deprecated predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at most one deprecated predicate: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-09 22:30:50,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-11-09 22:30:50,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...