/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-10 03:18:47,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-10 03:18:47,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-10 03:18:47,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-10 03:18:47,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-10 03:18:47,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-10 03:18:47,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-10 03:18:47,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-10 03:18:47,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-10 03:18:47,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-10 03:18:47,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-10 03:18:47,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-10 03:18:47,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-10 03:18:47,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-10 03:18:47,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-10 03:18:47,647 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-10 03:18:47,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-10 03:18:47,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-10 03:18:47,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-10 03:18:47,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-10 03:18:47,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-10 03:18:47,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-10 03:18:47,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-10 03:18:47,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-10 03:18:47,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-10 03:18:47,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-10 03:18:47,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-10 03:18:47,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-10 03:18:47,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-10 03:18:47,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-10 03:18:47,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-10 03:18:47,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-10 03:18:47,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-10 03:18:47,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-10 03:18:47,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-10 03:18:47,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-10 03:18:47,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-10 03:18:47,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-10 03:18:47,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-10 03:18:47,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-10 03:18:47,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-10 03:18:47,679 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-10 03:18:47,716 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-10 03:18:47,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-10 03:18:47,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-10 03:18:47,717 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-10 03:18:47,718 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-10 03:18:47,718 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-10 03:18:47,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-10 03:18:47,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-10 03:18:47,718 INFO L138 SettingsManager]: * Use SBE=true [2022-11-10 03:18:47,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-10 03:18:47,719 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-10 03:18:47,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-10 03:18:47,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-10 03:18:47,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-10 03:18:47,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-10 03:18:47,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-10 03:18:47,719 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-10 03:18:47,720 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-10 03:18:47,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-10 03:18:47,720 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-10 03:18:47,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-10 03:18:47,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-10 03:18:47,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-10 03:18:47,720 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-10 03:18:47,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-10 03:18:47,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 03:18:47,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-10 03:18:47,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-10 03:18:47,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-10 03:18:47,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-10 03:18:47,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-10 03:18:47,721 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-10 03:18:47,721 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-10 03:18:47,722 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-10 03:18:47,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-10 03:18:47,722 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-10 03:18:47,722 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-10 03:18:47,722 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-10 03:18:47,722 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-11-10 03:18:47,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-10 03:18:47,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-10 03:18:47,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-10 03:18:47,983 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-10 03:18:47,984 INFO L275 PluginConnector]: CDTParser initialized [2022-11-10 03:18:47,986 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2022-11-10 03:18:48,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93bbcc969/0e497b3345d042e0aa756e7b2385b2e2/FLAGe16598548 [2022-11-10 03:18:48,564 INFO L306 CDTParser]: Found 1 translation units. [2022-11-10 03:18:48,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2022-11-10 03:18:48,575 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93bbcc969/0e497b3345d042e0aa756e7b2385b2e2/FLAGe16598548 [2022-11-10 03:18:48,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93bbcc969/0e497b3345d042e0aa756e7b2385b2e2 [2022-11-10 03:18:48,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-10 03:18:48,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-10 03:18:48,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-10 03:18:48,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-10 03:18:48,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-10 03:18:48,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:18:48" (1/1) ... [2022-11-10 03:18:48,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11718462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:48, skipping insertion in model container [2022-11-10 03:18:48,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:18:48" (1/1) ... [2022-11-10 03:18:48,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-10 03:18:48,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-10 03:18:49,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i[41529,41542] [2022-11-10 03:18:49,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 03:18:49,254 INFO L203 MainTranslator]: Completed pre-run [2022-11-10 03:18:49,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i[41529,41542] [2022-11-10 03:18:49,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 03:18:49,348 INFO L208 MainTranslator]: Completed translation [2022-11-10 03:18:49,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:49 WrapperNode [2022-11-10 03:18:49,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-10 03:18:49,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-10 03:18:49,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-10 03:18:49,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-10 03:18:49,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:49" (1/1) ... [2022-11-10 03:18:49,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:49" (1/1) ... [2022-11-10 03:18:49,407 INFO L138 Inliner]: procedures = 277, calls = 40, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 194 [2022-11-10 03:18:49,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-10 03:18:49,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-10 03:18:49,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-10 03:18:49,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-10 03:18:49,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:49" (1/1) ... [2022-11-10 03:18:49,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:49" (1/1) ... [2022-11-10 03:18:49,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:49" (1/1) ... [2022-11-10 03:18:49,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:49" (1/1) ... [2022-11-10 03:18:49,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:49" (1/1) ... [2022-11-10 03:18:49,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:49" (1/1) ... [2022-11-10 03:18:49,447 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:49" (1/1) ... [2022-11-10 03:18:49,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:49" (1/1) ... [2022-11-10 03:18:49,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-10 03:18:49,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-10 03:18:49,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-10 03:18:49,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-10 03:18:49,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:49" (1/1) ... [2022-11-10 03:18:49,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 03:18:49,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:18:49,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-10 03:18:49,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-10 03:18:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-10 03:18:49,527 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-10 03:18:49,529 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-10 03:18:49,529 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-10 03:18:49,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-10 03:18:49,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-10 03:18:49,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-10 03:18:49,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-10 03:18:49,530 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-10 03:18:49,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-10 03:18:49,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-10 03:18:49,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-10 03:18:49,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-10 03:18:49,532 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-10 03:18:49,701 INFO L235 CfgBuilder]: Building ICFG [2022-11-10 03:18:49,703 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-10 03:18:50,127 INFO L276 CfgBuilder]: Performing block encoding [2022-11-10 03:18:50,135 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-10 03:18:50,135 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-10 03:18:50,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:18:50 BoogieIcfgContainer [2022-11-10 03:18:50,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-10 03:18:50,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-10 03:18:50,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-10 03:18:50,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-10 03:18:50,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:18:48" (1/3) ... [2022-11-10 03:18:50,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171daabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:18:50, skipping insertion in model container [2022-11-10 03:18:50,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:18:49" (2/3) ... [2022-11-10 03:18:50,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171daabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:18:50, skipping insertion in model container [2022-11-10 03:18:50,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:18:50" (3/3) ... [2022-11-10 03:18:50,146 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2022-11-10 03:18:50,153 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-10 03:18:50,161 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-10 03:18:50,162 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-11-10 03:18:50,162 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-10 03:18:50,290 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-10 03:18:50,348 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 03:18:50,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 03:18:50,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:18:50,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 03:18:50,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-10 03:18:50,387 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 03:18:50,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-10 03:18:50,407 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;@28cbc6a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 03:18:50,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-10 03:18:50,714 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:50,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:50,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1113155676, now seen corresponding path program 1 times [2022-11-10 03:18:50,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:50,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415425447] [2022-11-10 03:18:50,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:50,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:18:51,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:51,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415425447] [2022-11-10 03:18:51,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415425447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:18:51,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:18:51,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 03:18:51,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901006109] [2022-11-10 03:18:51,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:18:51,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 03:18:51,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:18:51,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 03:18:51,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 03:18:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:51,607 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:18:51,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:18:51,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:52,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:52,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-10 03:18:52,164 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:52,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:52,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1674377527, now seen corresponding path program 1 times [2022-11-10 03:18:52,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:52,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180860970] [2022-11-10 03:18:52,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:52,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:18:53,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:53,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180860970] [2022-11-10 03:18:53,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180860970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:18:53,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:18:53,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-10 03:18:53,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371064004] [2022-11-10 03:18:53,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:18:53,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-10 03:18:53,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:18:53,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-10 03:18:53,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-10 03:18:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:53,742 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:18:53,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:18:53,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:53,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:18:54,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:18:54,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:18:54,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-10 03:18:54,767 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:18:54,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:18:54,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1252600405, now seen corresponding path program 1 times [2022-11-10 03:18:54,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:18:54,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104737371] [2022-11-10 03:18:54,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:54,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:18:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:18:56,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:18:56,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104737371] [2022-11-10 03:18:56,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104737371] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:18:56,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677264036] [2022-11-10 03:18:56,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:18:56,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:18:56,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:18:56,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:18:56,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-10 03:18:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:18:56,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-10 03:18:56,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:18:56,944 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:18:56,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 03:18:57,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:18:57,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:57,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:18:57,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:57,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:57,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:18:57,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:57,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:57,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:57,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:18:57,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:57,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:18:57,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:57,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:18:57,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:18:57,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:18:57,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:18:59,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:18:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-10 03:18:59,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:18:59,421 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-10 03:18:59,489 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-10 03:19:13,052 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-10 03:19:13,351 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:19:13,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49 [2022-11-10 03:19:13,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:19:13,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34 [2022-11-10 03:19:13,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-10 03:19:13,470 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:19:13,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 03:19:13,480 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-10 03:19:13,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677264036] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:19:13,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:19:13,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 39 [2022-11-10 03:19:13,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979386233] [2022-11-10 03:19:13,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:19:13,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-10 03:19:13,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:13,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-10 03:19:13,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=982, Unknown=73, NotChecked=216, Total=1560 [2022-11-10 03:19:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:13,488 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:13,488 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-10 03:19:13,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:13,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:13,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:18,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:19:18,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-10 03:19:18,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-10 03:19:18,764 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:18,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1015781493, now seen corresponding path program 2 times [2022-11-10 03:19:18,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:18,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590178482] [2022-11-10 03:19:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:18,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:19,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:19,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590178482] [2022-11-10 03:19:19,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590178482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:19:19,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:19:19,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-10 03:19:19,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140217685] [2022-11-10 03:19:19,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:19:19,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-10 03:19:19,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:19,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-10 03:19:19,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-10 03:19:19,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:19,867 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:19,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:19:19,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:19,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:19,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:19:19,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:21,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:21,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:21,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:19:21,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:19:21,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-10 03:19:21,977 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:21,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:21,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1642850387, now seen corresponding path program 2 times [2022-11-10 03:19:21,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:21,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799946037] [2022-11-10 03:19:21,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:21,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:23,388 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:23,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:23,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799946037] [2022-11-10 03:19:23,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799946037] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:19:23,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512644711] [2022-11-10 03:19:23,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 03:19:23,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:19:23,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:19:23,390 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:19:23,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-10 03:19:23,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-10 03:19:23,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:19:23,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-10 03:19:23,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:19:23,642 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:19:23,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 03:19:23,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:19:23,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:23,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:19:23,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:23,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:23,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:19:24,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:24,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:19:24,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:24,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:24,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:24,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:19:24,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:24,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:19:24,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:24,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:19:25,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:25,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:19:26,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:26,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:19:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:26,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:19:27,116 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_~#arr~0.base|)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_250) |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))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_250) |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))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_250) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_250) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-10 03:19:27,720 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:19:27,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 03:19:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:27,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512644711] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:19:27,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:19:27,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2022-11-10 03:19:27,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175333597] [2022-11-10 03:19:27,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:19:27,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-10 03:19:27,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:27,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-10 03:19:27,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=590, Unknown=1, NotChecked=52, Total=812 [2022-11-10 03:19:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:27,728 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:27,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 10.0) internal successors, (280), 29 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:19:27,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:27,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:27,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:19:27,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:19:27,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:19:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:19:30,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-10 03:19:30,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:19:30,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:30,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:30,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1511408695, now seen corresponding path program 3 times [2022-11-10 03:19:30,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:30,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28796302] [2022-11-10 03:19:30,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:30,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:31,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:31,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28796302] [2022-11-10 03:19:31,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28796302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:19:31,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:19:31,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-10 03:19:31,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036981181] [2022-11-10 03:19:31,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:19:31,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-10 03:19:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:31,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-10 03:19:31,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-10 03:19:31,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:31,450 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:31,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-10 03:19:31,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:31,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:31,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:19:31,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:31,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:19:31,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:34,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:19:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:19:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:19:34,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-10 03:19:34,493 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:19:34,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:19:34,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1073557543, now seen corresponding path program 3 times [2022-11-10 03:19:34,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:19:34,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503376079] [2022-11-10 03:19:34,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:19:34,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:19:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:19:35,812 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:35,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:19:35,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503376079] [2022-11-10 03:19:35,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503376079] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:19:35,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539416731] [2022-11-10 03:19:35,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-10 03:19:35,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:19:35,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:19:35,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:19:35,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-10 03:19:35,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-10 03:19:35,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:19:35,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-10 03:19:35,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:19:36,099 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-10 03:19:36,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 03:19:36,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:19:36,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:36,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:19:37,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:37,015 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 23 treesize of output 23 [2022-11-10 03:19:37,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:37,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:37,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:19:37,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:37,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:37,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:37,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:19:37,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:37,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:19:37,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:37,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:19:37,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:37,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:19:39,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:19:39,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:19:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:19:39,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:19:39,098 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-10 03:19:39,316 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-10 03:19:54,498 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-10 03:19:54,512 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-10 03:19:54,866 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-11-10 03:19:54,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 19 [2022-11-10 03:19:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2022-11-10 03:19:54,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539416731] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:19:54,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:19:54,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 16] total 36 [2022-11-10 03:19:54,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653359800] [2022-11-10 03:19:54,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:19:54,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-10 03:19:54,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:19:54,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-10 03:19:54,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=834, Unknown=38, NotChecked=260, Total=1332 [2022-11-10 03:19:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:54,893 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:19:54,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 9.694444444444445) internal successors, (349), 37 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:19:54,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:54,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:54,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:19:54,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:54,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:19:54,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:19:54,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:19:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:19:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:19:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:19:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:19:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:19:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:19:59,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:19:59,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-10 03:20:00,022 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-10 03:20:00,022 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:00,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:00,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1537197203, now seen corresponding path program 4 times [2022-11-10 03:20:00,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:00,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974007142] [2022-11-10 03:20:00,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:00,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:01,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:01,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974007142] [2022-11-10 03:20:01,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974007142] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:20:01,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374491450] [2022-11-10 03:20:01,008 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-10 03:20:01,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:01,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:20:01,009 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:20:01,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-10 03:20:01,284 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-10 03:20:01,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:20:01,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-10 03:20:01,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:20:01,463 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:20:01,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 03:20:01,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:20:01,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:01,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:20:02,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:02,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-10 03:20:02,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:02,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:02,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:20:02,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:02,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:20:02,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:02,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:02,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:02,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:20:03,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:03,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:20:03,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:20:04,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:20:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:04,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:20:04,550 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|)))) is different from false [2022-11-10 03:20:04,718 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-10 03:20:04,760 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1))))) is different from false [2022-11-10 03:20:09,291 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_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_457) |c_~#arr~0.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_457) |c_~#arr~0.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_457) |c_~#arr~0.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_457) |c_~#arr~0.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-10 03:20:09,318 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_453 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_453))) (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_457) |c_~#arr~0.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_453 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_453))) (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_457) |c_~#arr~0.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_453 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_453))) (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_457) |c_~#arr~0.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_453 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_453))) (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_457) |c_~#arr~0.base| v_ArrVal_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-10 03:20:10,140 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |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|) .cse5 0)))) (and (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_453 (Array Int Int))) (= (select (select (store (let ((.cse0 (store .cse2 |c_~#arr~0.base| v_ArrVal_453))) (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_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_453 (Array Int Int))) (= (select (select (store (let ((.cse3 (store .cse2 |c_~#arr~0.base| v_ArrVal_453))) (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_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_453 (Array Int Int))) (= (select (select (store (let ((.cse4 (store .cse2 |c_~#arr~0.base| v_ArrVal_453))) (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_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_458 (Array Int Int)) (v_ArrVal_453 (Array Int Int))) (= (select (select (store (let ((.cse6 (store .cse2 |c_~#arr~0.base| v_ArrVal_453))) (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_458) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))))) is different from false [2022-11-10 03:20:10,559 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:10,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2022-11-10 03:20:10,568 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:10,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 60 [2022-11-10 03:20:10,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-10 03:20:10,672 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:20:10,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 03:20:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-10 03:20:10,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374491450] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:20:10,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:20:10,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 15] total 42 [2022-11-10 03:20:10,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873757975] [2022-11-10 03:20:10,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:20:10,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-10 03:20:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:10,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-10 03:20:10,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1056, Unknown=43, NotChecked=450, Total=1806 [2022-11-10 03:20:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:10,684 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:10,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 9.523809523809524) internal successors, (400), 43 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:20:10,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:10,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:10,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:10,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:10,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:10,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:10,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:10,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:15,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-10 03:20:15,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:15,342 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:15,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:15,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2056821664, now seen corresponding path program 1 times [2022-11-10 03:20:15,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:15,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509234831] [2022-11-10 03:20:15,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:15,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:15,594 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-10 03:20:15,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:15,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509234831] [2022-11-10 03:20:15,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509234831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:20:15,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:20:15,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 03:20:15,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708772980] [2022-11-10 03:20:15,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:20:15,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 03:20:15,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:15,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 03:20:15,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 03:20:15,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:15,598 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:15,598 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-10 03:20:15,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:15,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:15,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:15,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:15,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:15,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:15,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:15,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:15,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:16,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-10 03:20:16,238 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:16,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash 398470232, now seen corresponding path program 1 times [2022-11-10 03:20:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:16,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673713116] [2022-11-10 03:20:16,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:16,360 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-10 03:20:16,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:16,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673713116] [2022-11-10 03:20:16,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673713116] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:20:16,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475296293] [2022-11-10 03:20:16,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:16,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:16,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:20:16,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:20:16,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-10 03:20:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:16,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-10 03:20:16,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:20:16,585 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-10 03:20:16,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-10 03:20:16,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475296293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:20:16,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-10 03:20:16,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-10 03:20:16,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172648015] [2022-11-10 03:20:16,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:20:16,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 03:20:16,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:16,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 03:20:16,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-10 03:20:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:16,588 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:16,589 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-10 03:20:16,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:16,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:16,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:16,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:16,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:16,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:16,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:16,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:16,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:16,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:17,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-10 03:20:17,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:17,523 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:17,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:17,524 INFO L85 PathProgramCache]: Analyzing trace with hash 505642531, now seen corresponding path program 1 times [2022-11-10 03:20:17,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:17,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571932075] [2022-11-10 03:20:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:17,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:17,641 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-10 03:20:17,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:17,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571932075] [2022-11-10 03:20:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571932075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:20:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049325900] [2022-11-10 03:20:17,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:17,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:17,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:20:17,644 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:20:17,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-10 03:20:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:17,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-10 03:20:17,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:20:17,865 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-10 03:20:17,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-10 03:20:17,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049325900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:20:17,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-10 03:20:17,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-10 03:20:17,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165523930] [2022-11-10 03:20:17,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:20:17,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 03:20:17,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:17,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 03:20:17,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-10 03:20:17,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:17,867 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:17,868 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-10 03:20:17,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:17,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:17,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:17,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:17,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:17,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:17,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:17,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:17,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:17,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:17,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:18,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-10 03:20:18,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:18,589 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:18,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash -479679117, now seen corresponding path program 1 times [2022-11-10 03:20:18,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:18,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696095722] [2022-11-10 03:20:18,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:18,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:18,723 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-10 03:20:18,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:18,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696095722] [2022-11-10 03:20:18,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696095722] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:20:18,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338522105] [2022-11-10 03:20:18,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:18,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:18,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:20:18,728 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:20:18,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-10 03:20:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:18,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-10 03:20:18,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:20:19,094 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-10 03:20:19,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:20:19,304 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-10 03:20:19,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338522105] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:20:19,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:20:19,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-10 03:20:19,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259350547] [2022-11-10 03:20:19,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:20:19,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-10 03:20:19,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:19,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-10 03:20:19,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-10 03:20:19,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:19,307 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:19,308 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-10 03:20:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:19,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:20,256 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-10 03:20:20,440 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-10 03:20:20,440 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:20,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:20,441 INFO L85 PathProgramCache]: Analyzing trace with hash 333598519, now seen corresponding path program 5 times [2022-11-10 03:20:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:20,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263457360] [2022-11-10 03:20:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:20,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:21,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:21,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263457360] [2022-11-10 03:20:21,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263457360] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:20:21,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423877427] [2022-11-10 03:20:21,837 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-10 03:20:21,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:21,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:20:21,838 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:20:21,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-10 03:20:21,971 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-10 03:20:21,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:20:21,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-10 03:20:21,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:20:22,091 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:20:22,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 03:20:22,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:20:22,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:22,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:20:22,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:22,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-10 03:20:22,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:22,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:22,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:20:22,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:22,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:20:22,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:22,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:20:22,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:22,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:22,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:22,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:20:22,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:20:23,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:20:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:23,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:20:24,033 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-10 03:20:24,063 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-10 03:20:24,971 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-10 03:20:24,997 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-10 03:20:25,025 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-10 03:20:26,300 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:26,300 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-10 03:20:26,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:26,313 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-10 03:20:26,322 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-10 03:20:26,327 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-10 03:20:26,332 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-10 03:20:26,490 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:20:26,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 03:20:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-10 03:20:26,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423877427] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:20:26,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:20:26,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 40 [2022-11-10 03:20:26,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147401355] [2022-11-10 03:20:26,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:20:26,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-10 03:20:26,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:26,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-10 03:20:26,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1015, Unknown=47, NotChecked=360, Total=1640 [2022-11-10 03:20:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:26,546 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:26,547 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-10 03:20:26,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:26,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:26,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:26,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:26,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:26,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:26,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:26,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:26,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:26,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:26,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:26,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:26,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:29,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:29,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:29,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:29,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:29,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:29,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:29,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:29,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:29,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-10 03:20:29,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-10 03:20:30,135 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-10 03:20:30,136 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:30,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1751627110, now seen corresponding path program 6 times [2022-11-10 03:20:30,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:30,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786394085] [2022-11-10 03:20:30,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:30,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:31,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:31,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786394085] [2022-11-10 03:20:31,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786394085] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:20:31,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515072344] [2022-11-10 03:20:31,124 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-10 03:20:31,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:31,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:20:31,125 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:20:31,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-10 03:20:31,258 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-10 03:20:31,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:20:31,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-10 03:20:31,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:20:31,309 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:20:31,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 03:20:31,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:20:31,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:31,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:20:31,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:31,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-10 03:20:31,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:31,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:31,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:20:31,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:31,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:20:31,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:31,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:20:31,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:31,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:31,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:31,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:20:32,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:20:33,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:20:33,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:20:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:33,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:20:33,163 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1036 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1036 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1036 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1036 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-10 03:20:33,379 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1036 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1036 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1036 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1036 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))))) is different from false [2022-11-10 03:20:33,426 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1036 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1036 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1036 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1036 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-10 03:20:38,194 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_1036 (Array Int Int)) (v_ArrVal_1034 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1034) |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1034 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1034) |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1034 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1034) |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1034 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1034) |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))))) is different from false [2022-11-10 03:20:38,213 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1031))) (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_1034) |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1031))) (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_1034) |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1031))) (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_1034) |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1031))) (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_1034) |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)))) is different from false [2022-11-10 03:20:38,251 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_1036 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse0 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1031))) (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_1034) |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1031))) (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_1034) |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1031))) (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_1034) |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1031))) (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_1034) |c_~#arr~0.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))))) is different from false [2022-11-10 03:20:39,077 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:39,077 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-10 03:20:39,083 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:39,083 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-10 03:20:39,091 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-10 03:20:39,094 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-10 03:20:39,098 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-10 03:20:39,184 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:20:39,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 03:20:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 32 not checked. [2022-11-10 03:20:39,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515072344] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:20:39,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:20:39,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 38 [2022-11-10 03:20:39,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613469595] [2022-11-10 03:20:39,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:20:39,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-10 03:20:39,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:39,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-10 03:20:39,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=800, Unknown=33, NotChecked=402, Total=1482 [2022-11-10 03:20:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:39,194 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:39,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 10.18421052631579) internal successors, (387), 39 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:20:39,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:39,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:39,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:39,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:39,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:39,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:39,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:39,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:39,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:39,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:39,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:39,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:39,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-10 03:20:39,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:41,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-10 03:20:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-10 03:20:41,503 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-10 03:20:41,687 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-10 03:20:41,687 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1789225547, now seen corresponding path program 7 times [2022-11-10 03:20:41,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:41,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689359416] [2022-11-10 03:20:41,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:42,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:42,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689359416] [2022-11-10 03:20:42,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689359416] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:20:42,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177987585] [2022-11-10 03:20:42,569 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-10 03:20:42,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:42,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:20:42,571 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:20:42,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-10 03:20:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:42,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-10 03:20:42,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:20:42,922 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:20:42,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 03:20:43,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:20:43,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:43,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:20:43,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:43,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-10 03:20:43,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:43,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:43,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:20:43,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:43,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 32 treesize of output 30 [2022-11-10 03:20:43,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:43,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:20:43,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:43,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:20:43,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:43,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:43,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:43,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:20:44,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:44,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:20:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:45,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:20:46,180 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_~#arr~0.base|)) (forall ((v_ArrVal_1124 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1124) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1124 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1124) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1124 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1124) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-10 03:20:46,230 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (not (= |c_ULTIMATE.start_main_~#id1~0#1.base| |c_~#arr~0.base|)) (forall ((v_ArrVal_1124 (Array Int Int))) (= (select (select (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1124) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1124 (Array Int Int))) (= (select (select (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1124) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1124 (Array Int Int))) (= (select (select (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1124) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))))) is different from false [2022-11-10 03:20:46,750 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:20:46,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 03:20:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:46,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177987585] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:20:46,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:20:46,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 30 [2022-11-10 03:20:46,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882777010] [2022-11-10 03:20:46,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:20:46,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-10 03:20:46,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:46,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-10 03:20:46,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=652, Unknown=2, NotChecked=110, Total=930 [2022-11-10 03:20:46,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:46,758 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:46,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 9.4) internal successors, (282), 31 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:20:46,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:46,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:46,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:46,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:46,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:46,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:46,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:46,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:46,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:46,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:46,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:46,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:46,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-10 03:20:46,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-10 03:20:46,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-10 03:20:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-10 03:20:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-10 03:20:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:50,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-10 03:20:50,249 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,SelfDestructingSolverStorable14 [2022-11-10 03:20:50,249 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:50,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:50,250 INFO L85 PathProgramCache]: Analyzing trace with hash 289417623, now seen corresponding path program 4 times [2022-11-10 03:20:50,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:50,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787120635] [2022-11-10 03:20:50,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:50,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:50,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:50,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787120635] [2022-11-10 03:20:50,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787120635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 03:20:50,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 03:20:50,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-10 03:20:50,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012505757] [2022-11-10 03:20:50,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 03:20:50,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-10 03:20:50,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:50,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-10 03:20:50,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-10 03:20:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:50,774 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:50,774 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-10 03:20:50,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:50,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:50,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:50,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:50,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:50,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-10 03:20:50,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:50,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:50,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:50,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:50,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:50,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:50,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-10 03:20:50,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-10 03:20:50,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:50,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:53,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:53,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:53,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-10 03:20:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-10 03:20:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-10 03:20:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:53,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-10 03:20:53,312 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:53,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:53,313 INFO L85 PathProgramCache]: Analyzing trace with hash 999418187, now seen corresponding path program 8 times [2022-11-10 03:20:53,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:53,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113596607] [2022-11-10 03:20:53,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:53,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:20:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:54,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:20:54,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113596607] [2022-11-10 03:20:54,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113596607] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:20:54,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731185856] [2022-11-10 03:20:54,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 03:20:54,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:20:54,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:20:54,184 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:20:54,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-10 03:20:54,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-10 03:20:54,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:20:54,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-10 03:20:54,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:20:54,412 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:20:54,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 11 treesize of output 11 [2022-11-10 03:20:54,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:20:54,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:54,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-10 03:20:54,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:54,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:20:54,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:54,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:54,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:20:54,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:54,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:54,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:54,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:20:54,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:54,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 41 treesize of output 37 [2022-11-10 03:20:54,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:20:54,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:20:54,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:20:55,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:20:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:20:55,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:20:55,897 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-10 03:20:55,996 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-10 03:20:56,020 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-10 03:20:56,303 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1242) |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1242) |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1242) |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1242) |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-10 03:20:56,333 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_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1242) |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1242) |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1242) |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1242) |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))))) is different from false [2022-11-10 03:20:56,347 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_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1242) |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1242) |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)))) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1242) |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1242) |c_~#arr~0.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0))))) is different from false [2022-11-10 03:20:56,577 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:56,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49 [2022-11-10 03:20:56,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 03:20:56,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34 [2022-11-10 03:20:56,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-10 03:20:56,660 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:20:56,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 03:20:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-10 03:20:56,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731185856] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:20:56,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:20:56,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2022-11-10 03:20:56,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137617190] [2022-11-10 03:20:56,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:20:56,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-10 03:20:56,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:20:56,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-10 03:20:56,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=728, Unknown=6, NotChecked=378, Total=1332 [2022-11-10 03:20:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:56,668 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:20:56,668 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-10 03:20:56,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:56,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:56,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:56,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:56,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:56,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-10 03:20:56,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:56,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:56,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:56,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:56,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:56,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:56,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-10 03:20:56,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-10 03:20:56,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:56,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:56,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:20:59,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:20:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:20:59,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:20:59,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-10 03:20:59,930 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-10 03:20:59,930 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:20:59,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:20:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash -684794363, now seen corresponding path program 9 times [2022-11-10 03:20:59,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:20:59,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606102855] [2022-11-10 03:20:59,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:20:59,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:20:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:21:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:21:00,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:21:00,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606102855] [2022-11-10 03:21:00,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606102855] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:21:00,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102198020] [2022-11-10 03:21:00,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-10 03:21:00,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:21:00,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:21:00,880 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:21:00,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-10 03:21:01,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-10 03:21:01,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:21:01,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-10 03:21:01,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:21:01,074 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:21:01,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 03:21:01,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:21:01,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:01,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-10 03:21:01,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:01,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:21:01,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:01,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:01,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:21:01,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:01,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:21:01,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:01,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:01,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:01,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:21:01,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:01,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:21:01,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:01,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:21:02,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:02,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:21:02,821 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:21:02,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:21:02,843 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-10 03:21:02,956 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-10 03:21:02,981 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-10 03:21:09,560 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_1333 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1333) |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_1333 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1333) |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_1333 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1333) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1333) |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-10 03:21:09,580 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1329))) (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_1333) |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_1329 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1329))) (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_1333) |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_1329 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1329))) (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_1333) |c_~#arr~0.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1333 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1329))) (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_1333) |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-10 03:21:10,033 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:21:10,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 03:21:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-10 03:21:10,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102198020] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:21:10,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:21:10,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 34 [2022-11-10 03:21:10,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932190348] [2022-11-10 03:21:10,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:21:10,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-10 03:21:10,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:21:10,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-10 03:21:10,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=682, Unknown=29, NotChecked=300, Total=1190 [2022-11-10 03:21:10,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:21:10,040 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:21:10,040 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-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:21:10,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:21:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:21:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:21:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:21:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:21:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:21:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-10 03:21:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:21:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:21:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-10 03:21:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-10 03:21:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:21:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:21:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:21:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:21:13,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-10 03:21:13,658 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-10 03:21:13,658 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:21:13,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:21:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1888393047, now seen corresponding path program 10 times [2022-11-10 03:21:13,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:21:13,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752793075] [2022-11-10 03:21:13,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:21:13,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:21:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:21:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:21:14,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:21:14,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752793075] [2022-11-10 03:21:14,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752793075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:21:14,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924767896] [2022-11-10 03:21:14,451 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-10 03:21:14,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:21:14,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:21:14,452 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:21:14,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-10 03:21:14,740 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-10 03:21:14,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:21:14,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-10 03:21:14,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:21:14,828 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:21:14,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 03:21:14,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:21:15,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:15,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-10 03:21:15,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:15,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:21:15,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:15,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:15,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:21:15,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:15,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:21:15,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:15,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 32 treesize of output 30 [2022-11-10 03:21:15,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:15,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:15,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:15,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:21:15,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:15,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 41 treesize of output 37 [2022-11-10 03:21:16,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:16,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:21:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:21:16,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:21:16,732 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1425 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1425 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1425 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1425 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-10 03:21:16,833 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1425 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1425 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1425 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1425 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-10 03:21:17,207 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1424) |c_~#arr~0.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1424) |c_~#arr~0.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1424) |c_~#arr~0.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1424) |c_~#arr~0.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-10 03:21:17,221 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_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1424) |c_~#arr~0.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1424) |c_~#arr~0.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1424) |c_~#arr~0.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1424) |c_~#arr~0.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))))) is different from false [2022-11-10 03:21:17,237 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1421))) (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_1424) |c_~#arr~0.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1421))) (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_1424) |c_~#arr~0.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1421))) (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_1424) |c_~#arr~0.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1421 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1421))) (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_1424) |c_~#arr~0.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-10 03:21:17,567 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:21:17,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 03:21:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 13 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-10 03:21:17,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924767896] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:21:17,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:21:17,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 34 [2022-11-10 03:21:17,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766955355] [2022-11-10 03:21:17,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:21:17,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-10 03:21:17,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:21:17,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-10 03:21:17,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=690, Unknown=19, NotChecked=300, Total=1190 [2022-11-10 03:21:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:21:17,574 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:21:17,575 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-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-10 03:21:17,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:21:17,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:21:17,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:21:17,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:21:17,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-10 03:21:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:21:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:21:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:21:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:21:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:21:21,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-10 03:21:21,257 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-10 03:21:21,258 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-10 03:21:21,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 03:21:21,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1589365300, now seen corresponding path program 11 times [2022-11-10 03:21:21,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 03:21:21,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766826514] [2022-11-10 03:21:21,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 03:21:21,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 03:21:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 03:21:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:21:22,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 03:21:22,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766826514] [2022-11-10 03:21:22,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766826514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 03:21:22,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349746471] [2022-11-10 03:21:22,266 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-10 03:21:22,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 03:21:22,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 03:21:22,267 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 03:21:22,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-10 03:21:22,425 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-10 03:21:22,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 03:21:22,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-10 03:21:22,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 03:21:22,571 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 03:21:22,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 03:21:22,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-10 03:21:23,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:23,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-10 03:21:23,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:23,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-10 03:21:23,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:23,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:23,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-10 03:21:23,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:23,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:21:23,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:23,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-10 03:21:23,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:23,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:23,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 03:21:23,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-10 03:21:23,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:21:24,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:21:24,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-10 03:21:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 03:21:24,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 03:21:24,381 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-10 03:21:24,529 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-10 03:21:24,560 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-10 03:21:40,214 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_1521 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1519) |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1519) |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1519) |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1519) |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))))) is different from false [2022-11-10 03:21:40,233 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1516))) (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_1519) |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1516))) (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_1519) |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1516))) (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_1519) |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1516))) (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_1519) |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)))) is different from false [2022-11-10 03:21:40,269 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_1516 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1516))) (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_1519) |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse3 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1516))) (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_1519) |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse4))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1516))) (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_1519) |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1516))) (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_1519) |c_~#arr~0.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))))) is different from false [2022-11-10 03:21:40,569 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 03:21:40,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 03:21:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 32 not checked. [2022-11-10 03:21:40,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349746471] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 03:21:40,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 03:21:40,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 15] total 39 [2022-11-10 03:21:40,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105592053] [2022-11-10 03:21:40,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 03:21:40,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-10 03:21:40,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 03:21:40,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-10 03:21:40,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=921, Unknown=34, NotChecked=414, Total=1560 [2022-11-10 03:21:40,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:21:40,577 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 03:21:40,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 9.128205128205128) internal successors, (356), 40 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 03:21:40,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 03:21:40,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-10 03:21:40,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-10 03:21:40,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-10 03:21:40,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-10 03:21:40,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-10 03:21:40,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:21:40,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-10 03:21:40,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:40,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:40,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 03:21:40,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-10 03:21:40,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-10 03:21:40,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-10 03:21:40,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-10 03:21:40,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 03:21:40,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-10 03:21:40,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:21:40,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-10 03:21:40,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 03:21:54,718 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-10 03:21:54,903 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-10 03:21:54,904 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-10 03:21:54,907 INFO L158 Benchmark]: Toolchain (without parser) took 186060.06ms. Allocated memory was 197.1MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 168.4MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-11-10 03:21:54,907 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 197.1MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-10 03:21:54,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.31ms. Allocated memory was 197.1MB in the beginning and 305.1MB in the end (delta: 108.0MB). Free memory was 168.1MB in the beginning and 256.1MB in the end (delta: -88.0MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. [2022-11-10 03:21:54,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.53ms. Allocated memory is still 305.1MB. Free memory was 256.0MB in the beginning and 253.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-10 03:21:54,908 INFO L158 Benchmark]: Boogie Preprocessor took 43.57ms. Allocated memory is still 305.1MB. Free memory was 253.0MB in the beginning and 250.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-10 03:21:54,908 INFO L158 Benchmark]: RCFGBuilder took 685.04ms. Allocated memory is still 305.1MB. Free memory was 250.7MB in the beginning and 228.9MB in the end (delta: 21.9MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-11-10 03:21:54,908 INFO L158 Benchmark]: TraceAbstraction took 184767.30ms. Allocated memory was 305.1MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 228.3MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-11-10 03:21:54,909 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.19ms. Allocated memory is still 197.1MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 500.31ms. Allocated memory was 197.1MB in the beginning and 305.1MB in the end (delta: 108.0MB). Free memory was 168.1MB in the beginning and 256.1MB in the end (delta: -88.0MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.53ms. Allocated memory is still 305.1MB. Free memory was 256.0MB in the beginning and 253.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.57ms. Allocated memory is still 305.1MB. Free memory was 253.0MB in the beginning and 250.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 685.04ms. Allocated memory is still 305.1MB. Free memory was 250.7MB in the beginning and 228.9MB in the end (delta: 21.9MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 184767.30ms. Allocated memory was 305.1MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 228.3MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 1.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-10 03:21:54,929 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-10 03:21:55,168 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...