/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSmt.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dpor-d6e1636 [2023-01-10 15:17:06,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-10 15:17:06,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-10 15:17:06,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-10 15:17:06,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-10 15:17:06,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-10 15:17:06,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-10 15:17:06,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-10 15:17:06,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-10 15:17:06,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-10 15:17:06,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-10 15:17:06,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-10 15:17:06,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-10 15:17:06,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-10 15:17:06,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-10 15:17:06,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-10 15:17:06,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-10 15:17:06,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-10 15:17:06,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-10 15:17:06,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-10 15:17:06,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-10 15:17:06,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-10 15:17:06,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-10 15:17:06,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-10 15:17:06,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-10 15:17:06,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-10 15:17:06,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-10 15:17:06,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-10 15:17:06,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-10 15:17:06,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-10 15:17:06,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-10 15:17:06,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-10 15:17:06,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-10 15:17:06,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-10 15:17:06,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-10 15:17:06,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-10 15:17:06,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-10 15:17:06,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-10 15:17:06,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-10 15:17:06,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-10 15:17:06,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-10 15:17:06,759 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSmt.epf [2023-01-10 15:17:06,781 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-10 15:17:06,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-10 15:17:06,782 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-01-10 15:17:06,782 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-01-10 15:17:06,783 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-10 15:17:06,783 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-10 15:17:06,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-10 15:17:06,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-10 15:17:06,784 INFO L138 SettingsManager]: * Use SBE=true [2023-01-10 15:17:06,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-10 15:17:06,784 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-10 15:17:06,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-10 15:17:06,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-10 15:17:06,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-10 15:17:06,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-10 15:17:06,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-10 15:17:06,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-10 15:17:06,785 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-10 15:17:06,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-10 15:17:06,785 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-10 15:17:06,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-10 15:17:06,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-10 15:17:06,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-10 15:17:06,786 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-10 15:17:06,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-10 15:17:06,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 15:17:06,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-10 15:17:06,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-10 15:17:06,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-10 15:17:06,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-10 15:17:06,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-10 15:17:06,786 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-01-10 15:17:06,786 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-01-10 15:17:06,787 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-01-10 15:17:06,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-01-10 15:17:06,787 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2023-01-10 15:17:06,787 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-01-10 15:17:06,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2023-01-10 15:17:06,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-10 15:17:06,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-10 15:17:06,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-10 15:17:06,946 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-10 15:17:06,946 INFO L275 PluginConnector]: CDTParser initialized [2023-01-10 15:17:06,947 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2023-01-10 15:17:08,043 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-10 15:17:08,316 INFO L351 CDTParser]: Found 1 translation units. [2023-01-10 15:17:08,316 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2023-01-10 15:17:08,329 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5221dc6fa/d984c471a3f34a1e8119f6180550ef8f/FLAG18b75f243 [2023-01-10 15:17:08,340 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5221dc6fa/d984c471a3f34a1e8119f6180550ef8f [2023-01-10 15:17:08,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-10 15:17:08,343 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-10 15:17:08,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-10 15:17:08,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-10 15:17:08,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-10 15:17:08,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:17:08" (1/1) ... [2023-01-10 15:17:08,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ed4533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:17:08, skipping insertion in model container [2023-01-10 15:17:08,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:17:08" (1/1) ... [2023-01-10 15:17:08,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-10 15:17:08,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-10 15:17:08,509 WARN L631 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-01-10 15:17:08,685 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2023-01-10 15:17:08,689 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2023-01-10 15:17:08,689 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2023-01-10 15:17:08,734 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2023-01-10 15:17:08,734 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2023-01-10 15:17:08,735 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2023-01-10 15:17:08,736 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2023-01-10 15:17:08,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 15:17:08,749 INFO L203 MainTranslator]: Completed pre-run [2023-01-10 15:17:08,764 WARN L631 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-01-10 15:17:08,789 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2023-01-10 15:17:08,789 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2023-01-10 15:17:08,790 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2023-01-10 15:17:08,808 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2023-01-10 15:17:08,809 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2023-01-10 15:17:08,809 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2023-01-10 15:17:08,810 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2023-01-10 15:17:08,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 15:17:08,848 WARN L663 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-01-10 15:17:08,853 INFO L208 MainTranslator]: Completed translation [2023-01-10 15:17:08,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:17:08 WrapperNode [2023-01-10 15:17:08,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-10 15:17:08,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-10 15:17:08,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-10 15:17:08,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-10 15:17:08,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:17:08" (1/1) ... [2023-01-10 15:17:08,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:17:08" (1/1) ... [2023-01-10 15:17:08,887 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2023-01-10 15:17:08,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-10 15:17:08,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-10 15:17:08,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-10 15:17:08,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-10 15:17:08,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:17:08" (1/1) ... [2023-01-10 15:17:08,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:17:08" (1/1) ... [2023-01-10 15:17:08,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:17:08" (1/1) ... [2023-01-10 15:17:08,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:17:08" (1/1) ... [2023-01-10 15:17:08,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:17:08" (1/1) ... [2023-01-10 15:17:08,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:17:08" (1/1) ... [2023-01-10 15:17:08,906 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:17:08" (1/1) ... [2023-01-10 15:17:08,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:17:08" (1/1) ... [2023-01-10 15:17:08,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-10 15:17:08,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-10 15:17:08,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-10 15:17:08,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-10 15:17:08,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:17:08" (1/1) ... [2023-01-10 15:17:08,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 15:17:08,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:17:08,932 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) [2023-01-10 15:17:08,953 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 [2023-01-10 15:17:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2023-01-10 15:17:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2023-01-10 15:17:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2023-01-10 15:17:08,964 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2023-01-10 15:17:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-10 15:17:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-10 15:17:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-10 15:17:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-10 15:17:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-01-10 15:17:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-10 15:17:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-10 15:17:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-10 15:17:08,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-10 15:17:08,965 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-10 15:17:09,061 INFO L236 CfgBuilder]: Building ICFG [2023-01-10 15:17:09,062 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-10 15:17:09,296 INFO L277 CfgBuilder]: Performing block encoding [2023-01-10 15:17:09,302 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-10 15:17:09,302 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-01-10 15:17:09,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:17:09 BoogieIcfgContainer [2023-01-10 15:17:09,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-10 15:17:09,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-10 15:17:09,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-10 15:17:09,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-10 15:17:09,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:17:08" (1/3) ... [2023-01-10 15:17:09,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335ce312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:17:09, skipping insertion in model container [2023-01-10 15:17:09,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:17:08" (2/3) ... [2023-01-10 15:17:09,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335ce312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:17:09, skipping insertion in model container [2023-01-10 15:17:09,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:17:09" (3/3) ... [2023-01-10 15:17:09,333 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2023-01-10 15:17:09,338 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-01-10 15:17:09,344 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-10 15:17:09,344 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-01-10 15:17:09,345 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-10 15:17:09,422 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-10 15:17:09,451 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:17:09,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 15:17:09,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:17:09,467 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) [2023-01-10 15:17:09,496 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 [2023-01-10 15:17:09,523 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 15:17:09,528 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 15:17:09,532 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;@1abdf8f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:17:09,532 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 15:17:09,536 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 15:17:09,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 15:17:09,544 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 15:17:09,545 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/10) [2023-01-10 15:17:09,563 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:17:09,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 15:17:09,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:17:09,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 15:17:09,617 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 15:17:09,618 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 15:17:09,618 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;@1abdf8f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:17:09,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 15:17:09,619 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 15:17:09,619 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 15:17:09,620 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 15:17:09,620 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/10) [2023-01-10 15:17:09,623 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:17:09,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 15:17:09,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:17:09,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-01-10 15:17:09,630 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 15:17:09,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-01-10 15:17:09,659 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 15:17:09,659 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 15:17:09,660 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;@1abdf8f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:17:09,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 15:17:09,660 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 15:17:09,660 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 15:17:09,661 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 15:17:09,662 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/10) [2023-01-10 15:17:09,664 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:17:09,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 15:17:09,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:17:09,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 15:17:09,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2023-01-10 15:17:09,675 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 15:17:09,676 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 15:17:09,676 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;@1abdf8f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:17:09,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 15:17:09,676 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 15:17:09,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 15:17:09,678 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 15:17:09,678 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION was SAFE (4/10) [2023-01-10 15:17:09,685 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:17:09,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 15:17:09,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:17:09,688 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 15:17:09,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2023-01-10 15:17:09,692 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 15:17:09,693 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2023-01-10 15:17:09,693 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;@1abdf8f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:17:09,693 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 15:17:09,892 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-10 15:17:09,893 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 15:17:09,893 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (5/10) [2023-01-10 15:17:09,896 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:17:09,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 15:17:09,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:17:09,915 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 15:17:09,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2023-01-10 15:17:09,919 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 15:17:09,919 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2023-01-10 15:17:09,919 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;@1abdf8f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:17:09,919 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 15:17:09,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-10 15:17:09,923 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 15:17:09,923 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (6/10) [2023-01-10 15:17:09,928 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:17:09,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 15:17:09,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:17:09,931 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 15:17:09,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-01-10 15:17:09,950 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 15:17:09,961 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 15:17:09,961 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;@1abdf8f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:17:09,961 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 15:17:10,173 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:17:10,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:17:10,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1781473882, now seen corresponding path program 1 times [2023-01-10 15:17:10,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:17:10,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830171860] [2023-01-10 15:17:10,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:17:10,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:17:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:17:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 15:17:11,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:17:11,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830171860] [2023-01-10 15:17:11,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830171860] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 15:17:11,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 15:17:11,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-01-10 15:17:11,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945426818] [2023-01-10 15:17:11,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 15:17:11,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-10 15:17:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:17:11,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-10 15:17:11,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2023-01-10 15:17:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:17:11,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:17:11,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 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) [2023-01-10 15:17:11,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:17:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:17:13,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-10 15:17:13,766 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:17:13,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:17:13,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1493353800, now seen corresponding path program 1 times [2023-01-10 15:17:13,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:17:13,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82837404] [2023-01-10 15:17:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:17:13,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:17:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:17:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 15:17:16,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:17:16,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82837404] [2023-01-10 15:17:16,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82837404] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 15:17:16,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000026871] [2023-01-10 15:17:16,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:17:16,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:17:16,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:17:16,130 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) [2023-01-10 15:17:16,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-10 15:17:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:17:16,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 90 conjunts are in the unsatisfiable core [2023-01-10 15:17:16,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 15:17:16,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-10 15:17:16,343 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-10 15:17:16,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-01-10 15:17:16,371 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-01-10 15:17:16,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2023-01-10 15:17:16,415 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-01-10 15:17:16,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 15:17:16,430 INFO L350 Elim1Store]: Elim1 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 [2023-01-10 15:17:16,462 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 23 [2023-01-10 15:17:16,715 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 23 [2023-01-10 15:17:17,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 15:17:17,237 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 15:17:17,252 INFO L321 Elim1Store]: treesize reduction 63, result has 22.2 percent of original size [2023-01-10 15:17:17,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 39 [2023-01-10 15:17:17,483 INFO L321 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2023-01-10 15:17:17,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 30 [2023-01-10 15:17:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 15:17:17,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 15:17:19,175 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< v_ArrVal_69 1) (< 0 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) 4) v_ArrVal_69)))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))))) is different from false [2023-01-10 15:17:19,464 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< 0 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) 4) v_ArrVal_69)))) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| (* (select .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) 4) 4)))) (< v_ArrVal_69 1))) is different from false [2023-01-10 15:17:19,476 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< 0 (let ((.cse0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) 4) v_ArrVal_69)))) (select .cse0 (+ (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4)))) (< v_ArrVal_69 1))) is different from false [2023-01-10 15:17:19,486 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< 0 (let ((.cse0 (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) 4) 4) v_ArrVal_69)))) (select .cse0 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))) (< v_ArrVal_69 1))) is different from false [2023-01-10 15:17:19,506 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< v_ArrVal_69 1) (< 0 (let ((.cse0 (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base|) |c_ULTIMATE.start_ring_init_~r#1.offset| 0)) |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) 4) 4) v_ArrVal_69)))) (select .cse0 (+ (* 4 (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|)) |c_ULTIMATE.start_main_~#r~3#1.offset| 4)))))) is different from false [2023-01-10 15:17:19,516 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:17:19,516 INFO L350 Elim1Store]: Elim1 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 120 treesize of output 87 [2023-01-10 15:17:19,524 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:17:19,525 INFO L350 Elim1Store]: Elim1 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 392 treesize of output 380 [2023-01-10 15:17:19,533 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 15:17:19,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:17:19,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 206 treesize of output 197 [2023-01-10 15:17:19,569 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 15:17:19,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:17:19,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 324 treesize of output 255 [2023-01-10 15:17:19,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:17:19,619 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 9 [2023-01-10 15:17:19,945 INFO L321 Elim1Store]: treesize reduction 12, result has 91.1 percent of original size [2023-01-10 15:17:19,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 184 treesize of output 249 [2023-01-10 15:17:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-01-10 15:17:23,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000026871] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 15:17:23,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 15:17:23,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 31] total 73 [2023-01-10 15:17:23,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926440344] [2023-01-10 15:17:23,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 15:17:23,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-01-10 15:17:23,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:17:23,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-01-10 15:17:23,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=4322, Unknown=30, NotChecked=680, Total=5256 [2023-01-10 15:17:23,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:17:23,578 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:17:23,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 3.684931506849315) internal successors, (269), 73 states have internal predecessors, (269), 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) [2023-01-10 15:17:23,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:17:23,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:18:01,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:18:01,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-01-10 15:18:01,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-01-10 15:18:01,309 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,SelfDestructingSolverStorable1 [2023-01-10 15:18:01,310 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:18:01,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:18:01,310 INFO L85 PathProgramCache]: Analyzing trace with hash -642641542, now seen corresponding path program 1 times [2023-01-10 15:18:01,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:18:01,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909495483] [2023-01-10 15:18:01,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:18:01,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:18:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:18:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-01-10 15:18:01,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:18:01,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909495483] [2023-01-10 15:18:01,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909495483] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 15:18:01,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 15:18:01,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-10 15:18:01,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191535801] [2023-01-10 15:18:01,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 15:18:01,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-10 15:18:01,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:18:01,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-10 15:18:01,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-10 15:18:01,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:18:01,486 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:18:01,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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) [2023-01-10 15:18:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:18:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 117 states. [2023-01-10 15:18:01,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:18:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:18:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-01-10 15:18:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-10 15:18:02,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-10 15:18:02,922 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:18:02,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:18:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash 864616655, now seen corresponding path program 1 times [2023-01-10 15:18:02,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:18:02,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072948760] [2023-01-10 15:18:02,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:18:02,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:18:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:18:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 74 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-10 15:18:06,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:18:06,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072948760] [2023-01-10 15:18:06,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072948760] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 15:18:06,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147892475] [2023-01-10 15:18:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:18:06,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:18:06,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:18:06,995 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) [2023-01-10 15:18:06,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-10 15:18:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:18:07,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 134 conjunts are in the unsatisfiable core [2023-01-10 15:18:07,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 15:18:07,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-10 15:18:07,253 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-10 15:18:07,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-01-10 15:18:07,309 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-01-10 15:18:07,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-01-10 15:18:07,469 INFO L350 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-10 15:18:07,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 15:18:07,560 INFO L350 Elim1Store]: Elim1 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 [2023-01-10 15:18:07,655 INFO L350 Elim1Store]: Elim1 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 [2023-01-10 15:18:07,980 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-01-10 15:18:07,980 INFO L350 Elim1Store]: Elim1 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 [2023-01-10 15:18:08,277 INFO L350 Elim1Store]: Elim1 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 [2023-01-10 15:18:09,366 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 15:18:09,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 15:18:09,379 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2023-01-10 15:18:09,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 41 [2023-01-10 15:18:09,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 15:18:09,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2023-01-10 15:18:10,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-01-10 15:18:10,307 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 21 [2023-01-10 15:18:10,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:18:10,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2023-01-10 15:18:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 74 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-10 15:18:10,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 15:18:11,179 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20))))) is different from false [2023-01-10 15:18:11,229 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10#1| 1))) (let ((.cse4 (mod .cse0 4))) (let ((.cse5 (= .cse4 0)) (.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) (.cse3 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base|))) (and (or (<= 0 .cse0) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| (store .cse3 |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| (+ (- 4) .cse4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse1 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse1 .cse2)))) .cse5) (or (and (not .cse5) (< .cse0 0)) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| (store .cse3 |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| .cse4)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse6 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse6 .cse2))))))))) is different from false [2023-01-10 15:18:11,247 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base|))) (let ((.cse4 (+ (select .cse2 |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset|) 1))) (let ((.cse3 (mod .cse4 4))) (let ((.cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) (.cse5 (= .cse3 0))) (and (or (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| (store .cse2 |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| (+ .cse3 (- 4)))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse0 .cse1)))) (<= 0 .cse4) .cse5) (or (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.base| (store .cse2 |c_reader_twoThread1of1ForFork0_ring_dequeue_~r#1.offset| .cse3)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse6 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse6 .cse1)))) (and (< .cse4 0) (not .cse5)))))))) is different from false [2023-01-10 15:18:11,326 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base|))) (let ((.cse1 (+ (select .cse4 |c_reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset|) 1))) (let ((.cse5 (mod .cse1 4))) (let ((.cse0 (= .cse5 0)) (.cse3 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20))) (and (or (and (not .cse0) (< .cse1 0)) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| (store .cse4 |c_reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| .cse5)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse2 .cse3) (select .cse2 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))))) (or .cse0 (<= 0 .cse1) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.base| (store .cse4 |c_reader_twoThread1of1ForFork0_ring_dequeue_#in~r#1.offset| (+ (- 4) .cse5))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse6 .cse3) (select .cse6 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)))))))))) is different from false [2023-01-10 15:21:24,123 WARN L222 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 15:21:28,490 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) (.cse10 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_164 Int) (v_ArrVal_163 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_163))) (let ((.cse3 (let ((.cse11 (select .cse2 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse11 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse11 .cse10) 4) 4) v_ArrVal_164)))) (let ((.cse5 (+ (select .cse3 .cse10) 1))) (let ((.cse9 (mod .cse5 4))) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse3 .cse10 (+ .cse9 (- 4)))))) (let ((.cse8 (select .cse7 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse1 (+ (select .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse0 (mod .cse1 4))) (or (= .cse0 0) (<= 0 .cse1) (not (= (select (select .cse2 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select (select (store .cse2 |c_ULTIMATE.start_main_~#r~3#1.base| .cse3) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse4))) (<= 0 .cse5) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse6 (select (store (store .cse7 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ .cse0 (- 4)))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse6 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse6 .cse4)))) (= .cse9 0))))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int) (v_ArrVal_163 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_163))) (let ((.cse13 (let ((.cse20 (select .cse12 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse20 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse20 .cse10) 4) 4) v_ArrVal_164)))) (let ((.cse14 (+ (select .cse13 .cse10) 1))) (let ((.cse19 (mod .cse14 4))) (let ((.cse16 (store .cse12 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse13 .cse10 (+ .cse19 (- 4)))))) (let ((.cse17 (select .cse16 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse18 (mod (+ (select .cse17 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (not (= (select (select .cse12 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select (select (store .cse12 |c_ULTIMATE.start_main_~#r~3#1.base| .cse13) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse4))) (<= 0 .cse14) (let ((.cse15 (select (store (store .cse16 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse17 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse18)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse15 .cse4) (select .cse15 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (= .cse19 0) (not (= .cse18 0))))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int) (v_ArrVal_163 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_163))) (let ((.cse24 (let ((.cse28 (select .cse23 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse28 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse28 .cse10) 4) 4) v_ArrVal_164)))) (let ((.cse21 (+ (select .cse24 .cse10) 1))) (let ((.cse26 (store .cse23 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse24 .cse10 (mod .cse21 4))))) (let ((.cse27 (select .cse26 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse22 (+ (select .cse27 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (< .cse21 0) (< .cse22 0) (not (= (select (select .cse23 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select (select (store .cse23 |c_ULTIMATE.start_main_~#r~3#1.base| .cse24) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse4))) (let ((.cse25 (select (store (store .cse26 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse27 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse22 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse25 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse25 .cse4))))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int) (v_ArrVal_163 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_163))) (let ((.cse33 (let ((.cse37 (select .cse32 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse37 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse37 .cse10) 4) 4) v_ArrVal_164)))) (let ((.cse29 (mod (+ (select .cse33 .cse10) 1) 4))) (let ((.cse35 (store .cse32 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse33 .cse10 .cse29)))) (let ((.cse36 (select .cse35 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse30 (+ (select .cse36 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse31 (mod .cse30 4))) (or (not (= .cse29 0)) (<= 0 .cse30) (= .cse31 0) (not (= (select (select .cse32 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select (select (store .cse32 |c_ULTIMATE.start_main_~#r~3#1.base| .cse33) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse4))) (let ((.cse34 (select (store (store .cse35 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse36 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ .cse31 (- 4)))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse34 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse34 .cse4)))))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int) (v_ArrVal_163 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_163))) (let ((.cse39 (let ((.cse46 (select .cse38 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse46 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse46 .cse10) 4) 4) v_ArrVal_164)))) (let ((.cse40 (+ (select .cse39 .cse10) 1))) (let ((.cse45 (mod .cse40 4))) (let ((.cse42 (store .cse38 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse39 .cse10 (+ .cse45 (- 4)))))) (let ((.cse43 (select .cse42 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse44 (+ (select .cse43 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (not (= (select (select .cse38 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select (select (store .cse38 |c_ULTIMATE.start_main_~#r~3#1.base| .cse39) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse4))) (<= 0 .cse40) (let ((.cse41 (select (store (store .cse42 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse43 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse44 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse41 .cse4) (select .cse41 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (< .cse44 0) (= .cse45 0)))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int) (v_ArrVal_163 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_163))) (let ((.cse49 (let ((.cse54 (select .cse48 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse54 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse54 .cse10) 4) 4) v_ArrVal_164)))) (let ((.cse47 (+ (select .cse49 .cse10) 1))) (let ((.cse51 (store .cse48 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse49 .cse10 (mod .cse47 4))))) (let ((.cse52 (select .cse51 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse53 (mod (+ (select .cse52 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (< .cse47 0) (not (= (select (select .cse48 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select (select (store .cse48 |c_ULTIMATE.start_main_~#r~3#1.base| .cse49) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse4))) (let ((.cse50 (select (store (store .cse51 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse52 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse53)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse50 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse50 .cse4))) (not (= .cse53 0)))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int) (v_ArrVal_163 (Array Int Int))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_163))) (let ((.cse58 (let ((.cse62 (select .cse57 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse62 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse62 .cse10) 4) 4) v_ArrVal_164)))) (let ((.cse56 (mod (+ (select .cse58 .cse10) 1) 4))) (let ((.cse60 (store .cse57 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse58 .cse10 .cse56)))) (let ((.cse61 (select .cse60 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse55 (+ (select .cse61 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (< .cse55 0) (not (= .cse56 0)) (not (= (select (select .cse57 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select (select (store .cse57 |c_ULTIMATE.start_main_~#r~3#1.base| .cse58) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse4))) (let ((.cse59 (select (store (store .cse60 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse61 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse55 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse59 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse59 .cse4))))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int) (v_ArrVal_163 (Array Int Int))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_163))) (let ((.cse67 (let ((.cse71 (select .cse66 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse71 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse71 .cse10) 4) 4) v_ArrVal_164)))) (let ((.cse63 (+ (select .cse67 .cse10) 1))) (let ((.cse69 (store .cse66 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse67 .cse10 (mod .cse63 4))))) (let ((.cse70 (select .cse69 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse64 (+ (select .cse70 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse65 (mod .cse64 4))) (or (< .cse63 0) (<= 0 .cse64) (= .cse65 0) (not (= (select (select .cse66 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select (select (store .cse66 |c_ULTIMATE.start_main_~#r~3#1.base| .cse67) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse4))) (let ((.cse68 (select (store (store .cse69 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse70 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ .cse65 (- 4)))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse68 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse68 .cse4)))))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int) (v_ArrVal_163 (Array Int Int))) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_163))) (let ((.cse74 (let ((.cse79 (select .cse73 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse79 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse79 .cse10) 4) 4) v_ArrVal_164)))) (let ((.cse72 (mod (+ (select .cse74 .cse10) 1) 4))) (let ((.cse76 (store .cse73 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse74 .cse10 .cse72)))) (let ((.cse77 (select .cse76 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse78 (mod (+ (select .cse77 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (not (= .cse72 0)) (not (= (select (select .cse73 |c_reader_twoThread1of1ForFork0_~r~2#1.base|) |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select (select (store .cse73 |c_ULTIMATE.start_main_~#r~3#1.base| .cse74) |c_reader_twoThread1of1ForFork0_~r~2#1.base|) .cse4))) (let ((.cse75 (select (store (store .cse76 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse77 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse78)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse75 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse75 .cse4))) (not (= .cse78 0)))))))))))) is different from false [2023-01-10 15:22:15,088 WARN L222 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 15:23:15,174 WARN L222 SmtUtils]: Spent 15.84s on a formula simplification that was a NOOP. DAG size: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 15:24:11,179 WARN L222 SmtUtils]: Spent 11.23s on a formula simplification that was a NOOP. DAG size: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 15:24:42,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:24:42,579 INFO L350 Elim1Store]: Elim1 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 651 treesize of output 396 [2023-01-10 15:24:42,604 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:24:42,604 INFO L350 Elim1Store]: Elim1 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 654 treesize of output 636 [2023-01-10 15:24:42,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 246 [2023-01-10 15:24:42,634 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:24:42,634 INFO L350 Elim1Store]: Elim1 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 840 treesize of output 692 [2023-01-10 15:24:42,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 520 treesize of output 446 [2023-01-10 15:24:42,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:24:42,695 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 9 [2023-01-10 15:24:43,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:24:43,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 318 treesize of output 310 [2023-01-10 15:24:43,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:24:43,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 578 treesize of output 349 [2023-01-10 15:24:43,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:24:43,666 INFO L350 Elim1Store]: Elim1 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 1071 treesize of output 1039 [2023-01-10 15:24:43,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 246 [2023-01-10 15:24:43,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 345 [2023-01-10 15:24:43,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 509 treesize of output 385 [2023-01-10 15:24:43,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-01-10 15:24:43,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:24:43,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 455 treesize of output 423 [2023-01-10 15:24:45,074 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-01-10 15:24:45,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 581 treesize of output 1 [2023-01-10 15:24:45,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:24:45,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 711 treesize of output 430 [2023-01-10 15:24:45,096 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 15:24:45,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:24:45,163 INFO L350 Elim1Store]: Elim1 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 1021 treesize of output 989 [2023-01-10 15:24:45,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 429 treesize of output 381 [2023-01-10 15:24:45,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 507 treesize of output 411 [2023-01-10 15:24:45,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-01-10 15:24:45,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:24:45,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 486 treesize of output 468 [2023-01-10 15:25:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 19 not checked. [2023-01-10 15:25:03,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147892475] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 15:25:03,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 15:25:03,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 42, 42] total 120 [2023-01-10 15:25:03,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271543392] [2023-01-10 15:25:03,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 15:25:03,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 120 states [2023-01-10 15:25:03,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:25:03,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2023-01-10 15:25:03,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=638, Invalid=12438, Unknown=54, NotChecked=1150, Total=14280 [2023-01-10 15:25:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:25:03,974 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:25:03,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 120 states, 120 states have (on average 3.8666666666666667) internal successors, (464), 120 states have internal predecessors, (464), 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) [2023-01-10 15:25:03,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:25:03,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 117 states. [2023-01-10 15:25:03,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-10 15:25:03,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:26:42,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:26:49,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:27:40,920 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse32 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base|)) (.cse31 (+ |c_ULTIMATE.start_writer_fn_~arg#1.offset| 20)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base|)) (.cse10 (+ |c_ULTIMATE.start_writer_fn_#in~arg#1.offset| 20))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|)) (.cse12 (+ |c_ULTIMATE.start_writer_fn_#in~arg#1.offset| 4 (* 4 (select .cse11 .cse10)))) (.cse2 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) (.cse9 (+ 20 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset|)) (.cse33 (+ |c_ULTIMATE.start_writer_fn_~arg#1.offset| (* (select .cse32 .cse31) 4) 4))) (and (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0) (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_reader_twoThread1of1ForFork0_~arg#1.offset|) (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_ULTIMATE.start_ring_init_#in~r#1.offset|) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse8 (store .cse11 .cse12 v_ArrVal_164))) (let ((.cse7 (mod (+ (select .cse8 .cse10) 1) 4))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse8 .cse10 .cse7)))) (let ((.cse4 (select .cse3 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse6 (+ (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse5 (mod .cse6 4))) (or (let ((.cse1 (select (store (store .cse3 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ (- 4) .cse5))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse1 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse1 .cse2))) (<= 0 .cse6) (= .cse5 0) (not (= .cse7 0)) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse8) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))))))))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_ring_init_#in~r#1.base|) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) 0) (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_ULTIMATE.start_ring_init_~r#1.offset|) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse18 (store .cse11 .cse12 v_ArrVal_164))) (let ((.cse17 (+ (select .cse18 .cse10) 1))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse18 .cse10 (mod .cse17 4))))) (let ((.cse16 (select .cse15 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse13 (mod (+ (select .cse16 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (not (= .cse13 0)) (let ((.cse14 (select (store (store .cse15 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse16 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse13)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse14 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse14 .cse2))) (< .cse17 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse18) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9)))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse24 (store .cse11 .cse12 v_ArrVal_164))) (let ((.cse23 (+ (select .cse24 .cse10) 1))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse24 .cse10 (mod .cse23 4))))) (let ((.cse22 (select .cse21 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse19 (+ (select .cse22 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (< .cse19 0) (let ((.cse20 (select (store (store .cse21 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse22 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse19 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse20 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse20 .cse2))) (< .cse23 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse24) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base|) (+ 20 |c_ULTIMATE.start_ring_init_~r#1.offset|)) 0) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_~#read~0#1.base|)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse29 (store .cse32 .cse33 v_ArrVal_164))) (let ((.cse30 (mod (+ (select .cse29 .cse31) 1) 4))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse29 .cse31 .cse30)))) (let ((.cse27 (select .cse26 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse28 (+ (select .cse27 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (let ((.cse25 (select (store (store .cse26 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse27 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse28 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse25 .cse2) (select .cse25 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (< .cse28 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse29) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))) (not (= .cse30 0))))))))) (<= 1 |c_reader_twoThread1of1ForFork0_ring_empty_#res#1|) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_ring_init_~r#1.base|) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_~arg#1.base|) (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset|) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse39 (store .cse32 .cse33 v_ArrVal_164))) (let ((.cse38 (+ (select .cse39 .cse31) 1))) (let ((.cse40 (mod .cse38 4))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse39 .cse31 (+ .cse40 (- 4)))))) (let ((.cse37 (select .cse36 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse34 (mod (+ (select .cse37 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (not (= .cse34 0)) (let ((.cse35 (select (store (store .cse36 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse37 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse34)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse35 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse35 .cse2))) (<= 0 .cse38) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse39) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))) (= .cse40 0))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse47 (store .cse11 .cse12 v_ArrVal_164))) (let ((.cse41 (+ (select .cse47 .cse10) 1))) (let ((.cse46 (mod .cse41 4))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse47 .cse10 (+ .cse46 (- 4)))))) (let ((.cse44 (select .cse43 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse45 (+ (select .cse44 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (<= 0 .cse41) (let ((.cse42 (select (store (store .cse43 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse44 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse45 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse42 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse42 .cse2))) (< .cse45 0) (= .cse46 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse47) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))))))))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 1) (forall ((v_ArrVal_164 Int)) (let ((.cse55 (store .cse11 .cse12 v_ArrVal_164))) (let ((.cse50 (+ (select .cse55 .cse10) 1))) (let ((.cse54 (mod .cse50 4))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse55 .cse10 (+ .cse54 (- 4)))))) (let ((.cse53 (select .cse52 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse48 (+ (select .cse53 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse49 (mod .cse48 4))) (or (<= 0 .cse48) (= .cse49 0) (<= 0 .cse50) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse51 (select (store (store .cse52 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse53 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ .cse49 (- 4)))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse51 .cse2) (select .cse51 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)))) (= .cse54 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse55) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9)))))))))))) (= |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse60 (store .cse32 .cse33 v_ArrVal_164))) (let ((.cse61 (mod (+ (select .cse60 .cse31) 1) 4))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse60 .cse31 .cse61)))) (let ((.cse58 (select .cse57 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse59 (mod (+ (select .cse58 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (let ((.cse56 (select (store (store .cse57 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse58 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse59)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse56 .cse2) (select .cse56 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (not (= .cse59 0)) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse60) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))) (not (= .cse61 0))))))))) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse67 (store .cse32 .cse33 v_ArrVal_164))) (let ((.cse62 (+ (select .cse67 .cse31) 1))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse67 .cse31 (mod .cse62 4))))) (let ((.cse65 (select .cse64 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse66 (mod (+ (select .cse65 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (< .cse62 0) (let ((.cse63 (select (store (store .cse64 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse65 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse66)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse63 .cse2) (select .cse63 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (not (= .cse66 0)) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse67) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9)))))))))) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_~r~2#1.base|) (= |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| |c_reader_twoThread1of1ForFork0_~r~2#1.base|) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse73 (store .cse32 .cse33 v_ArrVal_164))) (let ((.cse72 (+ (select .cse73 .cse31) 1))) (let ((.cse74 (mod .cse72 4))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse73 .cse31 (+ .cse74 (- 4)))))) (let ((.cse70 (select .cse69 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse71 (+ (select .cse70 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (let ((.cse68 (select (store (store .cse69 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse70 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse71 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse68 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse68 .cse2))) (<= 0 .cse72) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse73) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))) (= .cse74 0) (< .cse71 0))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse80 (store .cse11 .cse12 v_ArrVal_164))) (let ((.cse76 (mod (+ (select .cse80 .cse10) 1) 4))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse80 .cse10 .cse76)))) (let ((.cse79 (select .cse78 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse75 (+ (select .cse79 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (< .cse75 0) (not (= .cse76 0)) (let ((.cse77 (select (store (store .cse78 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse79 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse75 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse77 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse77 .cse2))) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse80) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9)))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse86 (store .cse32 .cse33 v_ArrVal_164))) (let ((.cse81 (+ (select .cse86 .cse31) 1))) (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse86 .cse31 (mod .cse81 4))))) (let ((.cse84 (select .cse83 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse85 (+ (select .cse84 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (< .cse81 0) (let ((.cse82 (select (store (store .cse83 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse84 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse85 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse82 .cse2) (select .cse82 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (< .cse85 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse86) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9)))))))))) (not (= |c_ULTIMATE.start_main_~#writer~0#1.base| |c_reader_twoThread1of1ForFork0_~#read~0#1.base|)) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse93 (store .cse11 .cse12 v_ArrVal_164))) (let ((.cse88 (+ (select .cse93 .cse10) 1))) (let ((.cse92 (mod .cse88 4))) (let ((.cse90 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse93 .cse10 (+ .cse92 (- 4)))))) (let ((.cse91 (select .cse90 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse87 (mod (+ (select .cse91 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (not (= .cse87 0)) (<= 0 .cse88) (let ((.cse89 (select (store (store .cse90 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse91 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse87)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse89 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse89 .cse2))) (= .cse92 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse93) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse99 (store .cse11 .cse12 v_ArrVal_164))) (let ((.cse95 (mod (+ (select .cse99 .cse10) 1) 4))) (let ((.cse97 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse99 .cse10 .cse95)))) (let ((.cse98 (select .cse97 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse94 (mod (+ (select .cse98 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (not (= .cse94 0)) (not (= .cse95 0)) (let ((.cse96 (select (store (store .cse97 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse98 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse94)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse96 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse96 .cse2))) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse99) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9)))))))))) (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (<= |c_reader_twoThread1of1ForFork0_ring_empty_#res#1| 1) (forall ((v_ArrVal_164 Int)) (let ((.cse106 (store .cse32 .cse33 v_ArrVal_164))) (let ((.cse105 (+ (select .cse106 .cse31) 1))) (let ((.cse107 (mod .cse105 4))) (let ((.cse101 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse106 .cse31 (+ .cse107 (- 4)))))) (let ((.cse102 (select .cse101 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse104 (+ (select .cse102 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse103 (mod .cse104 4))) (or (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse100 (select (store (store .cse101 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse102 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ .cse103 (- 4)))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse100 .cse2) (select .cse100 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)))) (<= 0 .cse104) (<= 0 .cse105) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse106) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))) (= .cse107 0) (= .cse103 0)))))))))) (not (= |c_ULTIMATE.start_main_~#writer~0#1.base| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse114 (store .cse32 .cse33 v_ArrVal_164))) (let ((.cse108 (+ (select .cse114 .cse31) 1))) (let ((.cse111 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse114 .cse31 (mod .cse108 4))))) (let ((.cse112 (select .cse111 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse113 (+ (select .cse112 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse109 (mod .cse113 4))) (or (< .cse108 0) (= .cse109 0) (let ((.cse110 (select (store (store .cse111 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse112 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ (- 4) .cse109))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse110 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse110 .cse2))) (<= 0 .cse113) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse114) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))))))))))) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse121 (store .cse11 .cse12 v_ArrVal_164))) (let ((.cse120 (+ (select .cse121 .cse10) 1))) (let ((.cse116 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse121 .cse10 (mod .cse120 4))))) (let ((.cse117 (select .cse116 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse119 (+ (select .cse117 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse118 (mod .cse119 4))) (or (let ((.cse115 (select (store (store .cse116 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse117 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ (- 4) .cse118))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse115 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse115 .cse2))) (<= 0 .cse119) (= .cse118 0) (< .cse120 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse121) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse127 (store .cse32 .cse33 v_ArrVal_164))) (let ((.cse128 (mod (+ (select .cse127 .cse31) 1) 4))) (let ((.cse124 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse127 .cse31 .cse128)))) (let ((.cse125 (select .cse124 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse126 (+ (select .cse125 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse122 (mod .cse126 4))) (or (= .cse122 0) (let ((.cse123 (select (store (store .cse124 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse125 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ (- 4) .cse122))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse123 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse123 .cse2))) (<= 0 .cse126) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse127) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse9))) (not (= .cse128 0)))))))))) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|)))) is different from true [2023-01-10 15:27:42,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:27:44,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:27:46,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:27:48,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:27:52,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:27:54,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:27:56,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:28:00,546 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (.cse9 (+ 20 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|)) (.cse19 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse18 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (let ((.cse20 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse19 .cse18) 4) 4)) (.cse6 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) (.cse4 (+ 20 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset|)) (.cse11 (+ (* 4 (select .cse10 .cse9)) 4 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|))) (and (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse3 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse0 (+ (select .cse3 .cse9) 1))) (let ((.cse2 (mod .cse0 4))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse3 .cse9 (+ .cse2 (- 4)))))) (let ((.cse8 (select .cse7 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse1 (mod (+ 1 (select .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) 4))) (or (<= 0 .cse0) (not (= .cse1 0)) (= .cse2 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse3) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (let ((.cse5 (select (store (store .cse7 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse1)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse5 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse5 .cse6))))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse16 (store .cse19 .cse20 v_ArrVal_164))) (let ((.cse17 (mod (+ (select .cse16 .cse18) 1) 4))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse16 .cse18 .cse17)))) (let ((.cse14 (select .cse13 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse15 (+ (select .cse14 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (let ((.cse12 (select (store (store .cse13 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse14 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse15 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse12 .cse6) (select .cse12 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (< .cse15 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse16) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (not (= .cse17 0))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse25 (store .cse19 .cse20 v_ArrVal_164))) (let ((.cse26 (mod (+ (select .cse25 .cse18) 1) 4))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse25 .cse18 .cse26)))) (let ((.cse23 (select .cse22 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse24 (mod (+ (select .cse23 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (let ((.cse21 (select (store (store .cse22 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse23 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse24)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse21 .cse6) (select .cse21 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse25) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (not (= .cse24 0)) (not (= .cse26 0))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse33 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse27 (mod (+ (select .cse33 .cse9) 1) 4))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse33 .cse9 .cse27)))) (let ((.cse30 (select .cse29 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse32 (+ (select .cse30 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse31 (mod .cse32 4))) (or (not (= .cse27 0)) (let ((.cse28 (select (store (store .cse29 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse30 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ (- 4) .cse31))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse28 .cse6) (select .cse28 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (<= 0 .cse32) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse33) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (= .cse31 0))))))))) (forall ((v_ArrVal_164 Int)) (let ((.cse41 (store .cse19 .cse20 v_ArrVal_164))) (let ((.cse35 (+ (select .cse41 .cse18) 1))) (let ((.cse40 (mod .cse35 4))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse41 .cse18 (+ .cse40 (- 4)))))) (let ((.cse38 (select .cse37 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse39 (+ (select .cse38 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse34 (mod .cse39 4))) (or (= .cse34 0) (<= 0 .cse35) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse36 (select (store (store .cse37 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse38 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ .cse34 (- 4)))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse36 .cse6) (select .cse36 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)))) (<= 0 .cse39) (= .cse40 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse41) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4)))))))))))) (forall ((v_ArrVal_164 Int)) (let ((.cse45 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse42 (+ (select .cse45 .cse9) 1))) (let ((.cse43 (mod .cse42 4))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse45 .cse9 (+ .cse43 (- 4)))))) (let ((.cse48 (select .cse47 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse44 (+ 1 (select .cse48 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)))) (let ((.cse49 (mod .cse44 4))) (or (<= 0 .cse42) (= .cse43 0) (<= 0 .cse44) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse45) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse46 (select (store (store .cse47 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse48 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ (- 4) .cse49))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse46 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse46 .cse6)))) (= .cse49 0)))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse56 (store .cse19 .cse20 v_ArrVal_164))) (let ((.cse50 (+ (select .cse56 .cse18) 1))) (let ((.cse55 (mod .cse50 4))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse56 .cse18 (+ .cse55 (- 4)))))) (let ((.cse53 (select .cse52 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse54 (mod (+ (select .cse53 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (<= 0 .cse50) (let ((.cse51 (select (store (store .cse52 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse53 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse54)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse51 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse51 .cse6))) (= .cse55 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse56) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (not (= .cse54 0)))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse62 (store .cse19 .cse20 v_ArrVal_164))) (let ((.cse57 (+ (select .cse62 .cse18) 1))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse62 .cse18 (mod .cse57 4))))) (let ((.cse60 (select .cse59 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse61 (mod (+ (select .cse60 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (< .cse57 0) (let ((.cse58 (select (store (store .cse59 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse60 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse61)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse58 .cse6) (select .cse58 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse62) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (not (= .cse61 0))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse68 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse67 (+ (select .cse68 .cse9) 1))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse68 .cse9 (mod .cse67 4))))) (let ((.cse65 (select .cse64 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse66 (+ (select .cse65 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (let ((.cse63 (select (store (store .cse64 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse65 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse66 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse63 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse63 .cse6))) (< .cse67 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse68) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (< .cse66 0)))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse75 (store .cse19 .cse20 v_ArrVal_164))) (let ((.cse69 (+ (select .cse75 .cse18) 1))) (let ((.cse74 (mod .cse69 4))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse75 .cse18 (+ .cse74 (- 4)))))) (let ((.cse73 (select .cse72 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse70 (+ (select .cse73 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (<= 0 .cse69) (< .cse70 0) (let ((.cse71 (select (store (store .cse72 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse73 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse70 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse71 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse71 .cse6))) (= .cse74 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse75) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse81 (store .cse19 .cse20 v_ArrVal_164))) (let ((.cse82 (mod (+ (select .cse81 .cse18) 1) 4))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse81 .cse18 .cse82)))) (let ((.cse79 (select .cse78 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse76 (+ (select .cse79 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse80 (mod .cse76 4))) (or (<= 0 .cse76) (let ((.cse77 (select (store (store .cse78 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse79 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ .cse80 (- 4)))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse77 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse77 .cse6))) (= .cse80 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse81) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (not (= .cse82 0)))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse86 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse83 (+ (select .cse86 .cse9) 1))) (let ((.cse84 (mod .cse83 4))) (let ((.cse88 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse86 .cse9 (+ .cse84 (- 4)))))) (let ((.cse89 (select .cse88 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse85 (+ 1 (select .cse89 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)))) (or (<= 0 .cse83) (= .cse84 0) (< .cse85 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse86) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (let ((.cse87 (select (store (store .cse88 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse89 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse85 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse87 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse87 .cse6))))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse95 (store .cse19 .cse20 v_ArrVal_164))) (let ((.cse90 (+ (select .cse95 .cse18) 1))) (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse95 .cse18 (mod .cse90 4))))) (let ((.cse93 (select .cse92 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse94 (+ (select .cse93 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (< .cse90 0) (let ((.cse91 (select (store (store .cse92 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse93 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse94 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse91 .cse6) (select .cse91 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (< .cse94 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse95) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4)))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse102 (store .cse19 .cse20 v_ArrVal_164))) (let ((.cse97 (+ (select .cse102 .cse18) 1))) (let ((.cse99 (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse102 .cse18 (mod .cse97 4))))) (let ((.cse100 (select .cse99 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse96 (+ (select .cse100 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse101 (mod .cse96 4))) (or (<= 0 .cse96) (< .cse97 0) (let ((.cse98 (select (store (store .cse99 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse100 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ .cse101 (- 4)))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse98 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse98 .cse6))) (= .cse101 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse102) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse109 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse107 (+ (select .cse109 .cse9) 1))) (let ((.cse104 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse109 .cse9 (mod .cse107 4))))) (let ((.cse105 (select .cse104 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse108 (+ (select .cse105 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse106 (mod .cse108 4))) (or (let ((.cse103 (select (store (store .cse104 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse105 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ (- 4) .cse106))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse103 .cse6) (select .cse103 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (< .cse107 0) (<= 0 .cse108) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse109) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (= .cse106 0))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse115 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse114 (mod (+ (select .cse115 .cse9) 1) 4))) (let ((.cse111 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse115 .cse9 .cse114)))) (let ((.cse112 (select .cse111 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse113 (mod (+ (select .cse112 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (let ((.cse110 (select (store (store .cse111 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse112 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse113)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse110 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse110 .cse6))) (not (= .cse114 0)) (not (= .cse113 0)) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse115) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4)))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse121 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse120 (mod (+ (select .cse121 .cse9) 1) 4))) (let ((.cse117 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse121 .cse9 .cse120)))) (let ((.cse118 (select .cse117 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse119 (+ (select .cse118 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (let ((.cse116 (select (store (store .cse117 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse118 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse119 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse116 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse116 .cse6))) (not (= .cse120 0)) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse121) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (< .cse119 0)))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse127 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse126 (+ (select .cse127 .cse9) 1))) (let ((.cse123 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse127 .cse9 (mod .cse126 4))))) (let ((.cse124 (select .cse123 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse125 (mod (+ (select .cse124 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (let ((.cse122 (select (store (store .cse123 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse124 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse125)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse122 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse122 .cse6))) (< .cse126 0) (not (= .cse125 0)) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse127) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))))))))))))) is different from true [2023-01-10 15:28:05,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:28:07,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:28:10,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:28:13,183 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (.cse9 (+ 20 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|)) (.cse34 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse33 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse35 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* (select .cse34 .cse33) 4))) (.cse6 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) (.cse4 (+ 20 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset|)) (.cse11 (+ (* 4 (select .cse10 .cse9)) 4 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|))) (and (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse3 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse0 (+ (select .cse3 .cse9) 1))) (let ((.cse2 (mod .cse0 4))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse3 .cse9 (+ .cse2 (- 4)))))) (let ((.cse8 (select .cse7 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse1 (mod (+ 1 (select .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)) 4))) (or (<= 0 .cse0) (not (= .cse1 0)) (= .cse2 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse3) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (let ((.cse5 (select (store (store .cse7 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse1)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse5 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse5 .cse6))))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse18 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse12 (mod (+ (select .cse18 .cse9) 1) 4))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse18 .cse9 .cse12)))) (let ((.cse15 (select .cse14 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse17 (+ (select .cse15 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse16 (mod .cse17 4))) (or (not (= .cse12 0)) (let ((.cse13 (select (store (store .cse14 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse15 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ (- 4) .cse16))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse13 .cse6) (select .cse13 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (<= 0 .cse17) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse18) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (= .cse16 0))))))))) (forall ((v_ArrVal_164 Int)) (let ((.cse22 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse19 (+ (select .cse22 .cse9) 1))) (let ((.cse20 (mod .cse19 4))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse22 .cse9 (+ .cse20 (- 4)))))) (let ((.cse25 (select .cse24 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse21 (+ 1 (select .cse25 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)))) (let ((.cse26 (mod .cse21 4))) (or (<= 0 .cse19) (= .cse20 0) (<= 0 .cse21) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse22) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse23 (select (store (store .cse24 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse25 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ (- 4) .cse26))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse23 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse23 .cse6)))) (= .cse26 0)))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse28 (store .cse34 .cse35 v_ArrVal_164))) (let ((.cse27 (+ (select .cse28 .cse33) 1))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse28 .cse33 (mod .cse27 4))))) (let ((.cse32 (select .cse31 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse29 (+ (select .cse32 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (< .cse27 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| .cse28) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (< .cse29 0) (let ((.cse30 (select (store (store .cse31 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse32 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse29 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse30 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse30 .cse6)))))))))) (forall ((v_ArrVal_164 Int)) (let ((.cse38 (store .cse34 .cse35 v_ArrVal_164))) (let ((.cse43 (+ (select .cse38 .cse33) 1))) (let ((.cse37 (mod .cse43 4))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse38 .cse33 (+ .cse37 (- 4)))))) (let ((.cse42 (select .cse41 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse36 (+ (select .cse42 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse39 (mod .cse36 4))) (or (<= 0 .cse36) (= .cse37 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| .cse38) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (= .cse39 0) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse40 (select (store (store .cse41 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse42 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ (- 4) .cse39))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse40 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse40 .cse6)))) (<= 0 .cse43)))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse49 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse48 (+ (select .cse49 .cse9) 1))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse49 .cse9 (mod .cse48 4))))) (let ((.cse46 (select .cse45 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse47 (+ (select .cse46 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (let ((.cse44 (select (store (store .cse45 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse46 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse47 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse44 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse44 .cse6))) (< .cse48 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse49) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (< .cse47 0)))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse51 (store .cse34 .cse35 v_ArrVal_164))) (let ((.cse50 (+ (select .cse51 .cse33) 1))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse51 .cse33 (mod .cse50 4))))) (let ((.cse54 (select .cse53 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse56 (+ (select .cse54 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse55 (mod .cse56 4))) (or (< .cse50 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| .cse51) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (let ((.cse52 (select (store (store .cse53 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse54 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ .cse55 (- 4)))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse52 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse52 .cse6))) (<= 0 .cse56) (= .cse55 0))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse57 (store .cse34 .cse35 v_ArrVal_164))) (let ((.cse59 (mod (+ (select .cse57 .cse33) 1) 4))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse57 .cse33 .cse59)))) (let ((.cse62 (select .cse61 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse58 (+ (select .cse62 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| .cse57) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (< .cse58 0) (not (= .cse59 0)) (let ((.cse60 (select (store (store .cse61 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse62 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse58 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse60 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse60 .cse6)))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse64 (store .cse34 .cse35 v_ArrVal_164))) (let ((.cse63 (+ (select .cse64 .cse33) 1))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse64 .cse33 (mod .cse63 4))))) (let ((.cse67 (select .cse66 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse68 (mod (+ (select .cse67 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (< .cse63 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| .cse64) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (let ((.cse65 (select (store (store .cse66 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse67 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse68)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse65 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse65 .cse6))) (not (= .cse68 0))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse72 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse69 (+ (select .cse72 .cse9) 1))) (let ((.cse70 (mod .cse69 4))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse72 .cse9 (+ .cse70 (- 4)))))) (let ((.cse75 (select .cse74 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse71 (+ 1 (select .cse75 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|)))) (or (<= 0 .cse69) (= .cse70 0) (< .cse71 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse72) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (let ((.cse73 (select (store (store .cse74 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse75 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse71 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse73 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse73 .cse6))))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse82 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse80 (+ (select .cse82 .cse9) 1))) (let ((.cse77 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse82 .cse9 (mod .cse80 4))))) (let ((.cse78 (select .cse77 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse81 (+ (select .cse78 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse79 (mod .cse81 4))) (or (let ((.cse76 (select (store (store .cse77 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse78 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ (- 4) .cse79))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse76 .cse6) (select .cse76 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (< .cse80 0) (<= 0 .cse81) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse82) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (= .cse79 0))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse83 (store .cse34 .cse35 v_ArrVal_164))) (let ((.cse84 (mod (+ (select .cse83 .cse33) 1) 4))) (let ((.cse86 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse83 .cse33 .cse84)))) (let ((.cse87 (select .cse86 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse89 (+ (select .cse87 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (let ((.cse88 (mod .cse89 4))) (or (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| .cse83) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (not (= .cse84 0)) (let ((.cse85 (select (store (store .cse86 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse87 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (+ .cse88 (- 4)))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse85 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse85 .cse6))) (<= 0 .cse89) (= .cse88 0))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse95 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse94 (mod (+ (select .cse95 .cse9) 1) 4))) (let ((.cse91 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse95 .cse9 .cse94)))) (let ((.cse92 (select .cse91 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse93 (mod (+ (select .cse92 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (let ((.cse90 (select (store (store .cse91 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse92 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse93)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse90 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse90 .cse6))) (not (= .cse94 0)) (not (= .cse93 0)) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse95) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4)))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse97 (store .cse34 .cse35 v_ArrVal_164))) (let ((.cse102 (+ (select .cse97 .cse33) 1))) (let ((.cse96 (mod .cse102 4))) (let ((.cse99 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse97 .cse33 (+ .cse96 (- 4)))))) (let ((.cse100 (select .cse99 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse101 (+ (select .cse100 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (= .cse96 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| .cse97) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (let ((.cse98 (select (store (store .cse99 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse100 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse101 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse98 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse98 .cse6))) (< .cse101 0) (<= 0 .cse102))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse108 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse107 (mod (+ (select .cse108 .cse9) 1) 4))) (let ((.cse104 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse108 .cse9 .cse107)))) (let ((.cse105 (select .cse104 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse106 (+ (select .cse105 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1))) (or (let ((.cse103 (select (store (store .cse104 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse105 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (mod .cse106 4))) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse103 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse103 .cse6))) (not (= .cse107 0)) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse108) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (< .cse106 0)))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse110 (store .cse34 .cse35 v_ArrVal_164))) (let ((.cse115 (+ (select .cse110 .cse33) 1))) (let ((.cse109 (mod .cse115 4))) (let ((.cse113 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse110 .cse33 (+ .cse109 (- 4)))))) (let ((.cse114 (select .cse113 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse111 (mod (+ (select .cse114 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (= .cse109 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| .cse110) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (not (= .cse111 0)) (let ((.cse112 (select (store (store .cse113 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse114 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse111)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse112 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse112 .cse6))) (<= 0 .cse115))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse116 (store .cse34 .cse35 v_ArrVal_164))) (let ((.cse117 (mod (+ (select .cse116 .cse33) 1) 4))) (let ((.cse119 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse116 .cse33 .cse117)))) (let ((.cse120 (select .cse119 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse121 (mod (+ (select .cse120 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| .cse116) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))) (not (= .cse117 0)) (let ((.cse118 (select (store (store .cse119 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse120 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse121)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse118 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse118 .cse6))) (not (= .cse121 0))))))))) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_164 Int)) (let ((.cse127 (store .cse10 .cse11 v_ArrVal_164))) (let ((.cse126 (+ (select .cse127 .cse9) 1))) (let ((.cse123 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse127 .cse9 (mod .cse126 4))))) (let ((.cse124 (select .cse123 |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse125 (mod (+ (select .cse124 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 1) 4))) (or (let ((.cse122 (select (store (store .cse123 |c_reader_twoThread1of1ForFork0_~r~2#1.base| (store .cse124 |c_reader_twoThread1of1ForFork0_~r~2#1.offset| .cse125)) |c_reader_twoThread1of1ForFork0_~#read~0#1.base| v_ArrVal_170) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (= (select .cse122 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (select .cse122 .cse6))) (< .cse126 0) (not (= .cse125 0)) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| .cse127) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse4))))))))))))) is different from true [2023-01-10 15:28:16,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:28:18,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:28:21,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:28:23,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:28:25,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:28:28,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:28:33,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:28:35,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:28:38,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:28:44,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:29:32,461 WARN L222 SmtUtils]: Spent 18.13s on a formula simplification that was a NOOP. DAG size: 193 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 15:29:34,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:29:36,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:29:39,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:29:41,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:29:42,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:29:44,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:29:46,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:29:50,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:29:52,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:29:54,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:29:55,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:29:56,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:30:00,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:30:03,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:30:08,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:30:22,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:30:26,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:30:35,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:30:40,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:30:44,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:30:46,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:30:52,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:31:04,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:31:10,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:31:13,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:31:17,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:31:20,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:31:22,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:31:25,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:31:28,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:31:30,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 15:31:32,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-01-10 15:31:34,139 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 15:31:34,139 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 15:31:34,139 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 15:31:34,148 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 15:31:34,148 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 15:31:34,183 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 15:31:34,183 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 15:31:34,183 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 15:31:34,188 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 15:31:35,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2023-01-10 15:31:35,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2023-01-10 15:31:35,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Ended with exit code 0 [2023-01-10 15:31:35,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-10 15:31:35,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2023-01-10 15:31:35,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-01-10 15:31:35,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Ended with exit code 0 [2023-01-10 15:31:35,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Forceful destruction successful, exit code 0 [2023-01-10 15:31:35,373 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-10 15:31:35,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-10 15:31:35,426 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-01-10 15:31:35,427 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 15:31:35,430 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-01-10 15:31:35,431 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (7/10) [2023-01-10 15:31:35,432 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-10 15:31:35,432 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-10 15:31:35,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:31:35 BasicIcfg [2023-01-10 15:31:35,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-10 15:31:35,456 INFO L158 Benchmark]: Toolchain (without parser) took 867112.83ms. Allocated memory was 179.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 144.1MB in the beginning and 524.3MB in the end (delta: -380.2MB). Peak memory consumption was 838.5MB. Max. memory is 8.0GB. [2023-01-10 15:31:35,456 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 179.3MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-01-10 15:31:35,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.16ms. Allocated memory is still 179.3MB. Free memory was 144.1MB in the beginning and 110.2MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2023-01-10 15:31:35,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.24ms. Allocated memory is still 179.3MB. Free memory was 110.2MB in the beginning and 107.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-01-10 15:31:35,456 INFO L158 Benchmark]: Boogie Preprocessor took 21.76ms. Allocated memory is still 179.3MB. Free memory was 107.1MB in the beginning and 105.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-01-10 15:31:35,456 INFO L158 Benchmark]: RCFGBuilder took 393.89ms. Allocated memory is still 179.3MB. Free memory was 105.0MB in the beginning and 83.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-01-10 15:31:35,456 INFO L158 Benchmark]: TraceAbstraction took 866149.91ms. Allocated memory was 179.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 82.2MB in the beginning and 524.3MB in the end (delta: -442.1MB). Peak memory consumption was 776.6MB. Max. memory is 8.0GB. [2023-01-10 15:31:35,464 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks [2023-01-10 15:31:35,469 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 137 Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 179.3MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 509.16ms. Allocated memory is still 179.3MB. Free memory was 144.1MB in the beginning and 110.2MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.24ms. Allocated memory is still 179.3MB. Free memory was 110.2MB in the beginning and 107.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.76ms. Allocated memory is still 179.3MB. Free memory was 107.1MB in the beginning and 105.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 393.89ms. Allocated memory is still 179.3MB. Free memory was 105.0MB in the beginning and 83.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 866149.91ms. Allocated memory was 179.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 82.2MB in the beginning and 524.3MB in the end (delta: -442.1MB). Peak memory consumption was 776.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2121786083782702.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2121786166408640.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2121786207818915.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2121786224197410.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 617, independent: 522, independent conditional: 522, independent unconditional: 0, dependent: 95, dependent conditional: 95, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 617, independent: 522, independent conditional: 522, independent unconditional: 0, dependent: 95, dependent conditional: 95, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 530, independent: 522, independent conditional: 522, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 530, independent: 522, independent conditional: 522, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 530, independent: 522, independent conditional: 0, independent unconditional: 522, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 530, independent: 522, independent conditional: 0, independent unconditional: 522, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 530, independent: 522, independent conditional: 0, independent unconditional: 522, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 520, independent: 512, independent conditional: 0, independent unconditional: 512, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 520, independent: 512, independent conditional: 0, independent unconditional: 512, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 530, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 520, unknown conditional: 0, unknown unconditional: 520] , Statistics on independence cache: Total cache size (in pairs): 520, Positive cache size: 512, Positive conditional cache size: 0, Positive unconditional cache size: 512, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 87, Statistics for Abstraction: - StatisticsResult: Traversal Statistics Data States: 522, Transitions: 586, Traversal time: 183380582.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 25 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Traversal Statistics Data States: 35, Transitions: 34, Traversal time: 2274517.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2903, independent: 2705, independent conditional: 2705, independent unconditional: 0, dependent: 198, dependent conditional: 198, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 429232, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 31667, dependent conditional: 31667, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 398545, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 980, dependent conditional: 980, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 398545, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 980, dependent conditional: 980, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 2013, dependent unconditional: 980, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 0, dependent unconditional: 2993, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 0, dependent unconditional: 2993, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5793, independent: 5772, independent conditional: 0, independent unconditional: 5772, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5793, independent: 5772, independent conditional: 0, independent unconditional: 5772, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 400558, independent: 391793, independent conditional: 0, independent unconditional: 391793, dependent: 2972, dependent conditional: 0, dependent unconditional: 2972, unknown: 5793, unknown conditional: 0, unknown unconditional: 5793] , Statistics on independence cache: Total cache size (in pairs): 1484, Positive cache size: 1484, Positive conditional cache size: 0, Positive unconditional cache size: 1484, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 198, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 46919, independent: 43972, independent conditional: 43972, independent unconditional: 0, dependent: 2947, dependent conditional: 2947, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 429232, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 31667, dependent conditional: 31667, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 398545, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 980, dependent conditional: 980, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 398545, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 980, dependent conditional: 980, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 2013, dependent unconditional: 980, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 0, dependent unconditional: 2993, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 0, dependent unconditional: 2993, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5793, independent: 5772, independent conditional: 0, independent unconditional: 5772, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5793, independent: 5772, independent conditional: 0, independent unconditional: 5772, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 400558, independent: 391793, independent conditional: 0, independent unconditional: 391793, dependent: 2972, dependent conditional: 0, dependent unconditional: 2972, unknown: 5793, unknown conditional: 0, unknown unconditional: 5793] , Statistics on independence cache: Total cache size (in pairs): 3064, Positive cache size: 3058, Positive conditional cache size: 0, Positive unconditional cache size: 3058, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 62, Maximal queried relation: 1, Independence queries for same thread: 3083, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 187983, independent: 173986, independent conditional: 173986, independent unconditional: 0, dependent: 13997, dependent conditional: 13997, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 429232, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 31667, dependent conditional: 31667, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 398545, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 980, dependent conditional: 980, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 398545, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 980, dependent conditional: 980, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 2013, dependent unconditional: 980, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 0, dependent unconditional: 2993, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 0, dependent unconditional: 2993, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5793, independent: 5772, independent conditional: 0, independent unconditional: 5772, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5793, independent: 5772, independent conditional: 0, independent unconditional: 5772, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 400558, independent: 391793, independent conditional: 0, independent unconditional: 391793, dependent: 2972, dependent conditional: 0, dependent unconditional: 2972, unknown: 5793, unknown conditional: 0, unknown unconditional: 5793] , Statistics on independence cache: Total cache size (in pairs): 5378, Positive cache size: 5361, Positive conditional cache size: 0, Positive unconditional cache size: 5361, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 956, Maximal queried relation: 2, Independence queries for same thread: 16633, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 187050, independent: 172874, independent conditional: 172874, independent unconditional: 0, dependent: 14176, dependent conditional: 14176, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 429232, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 31667, dependent conditional: 31667, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 398545, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 980, dependent conditional: 980, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 398545, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 980, dependent conditional: 980, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 2013, dependent unconditional: 980, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 0, dependent unconditional: 2993, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 0, dependent unconditional: 2993, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5793, independent: 5772, independent conditional: 0, independent unconditional: 5772, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5793, independent: 5772, independent conditional: 0, independent unconditional: 5772, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 400558, independent: 391793, independent conditional: 0, independent unconditional: 391793, dependent: 2972, dependent conditional: 0, dependent unconditional: 2972, unknown: 5793, unknown conditional: 0, unknown unconditional: 5793] , Statistics on independence cache: Total cache size (in pairs): 5648, Positive cache size: 5631, Positive conditional cache size: 0, Positive unconditional cache size: 5631, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1978, Maximal queried relation: 3, Independence queries for same thread: 30354, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4377, independent: 4028, independent conditional: 4028, independent unconditional: 0, dependent: 349, dependent conditional: 349, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 429232, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 31667, dependent conditional: 31667, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 398545, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 980, dependent conditional: 980, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 398545, independent: 397565, independent conditional: 397565, independent unconditional: 0, dependent: 980, dependent conditional: 980, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 2013, dependent unconditional: 980, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 0, dependent unconditional: 2993, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 400558, independent: 397565, independent conditional: 0, independent unconditional: 397565, dependent: 2993, dependent conditional: 0, dependent unconditional: 2993, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5793, independent: 5772, independent conditional: 0, independent unconditional: 5772, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5793, independent: 5772, independent conditional: 0, independent unconditional: 5772, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 400558, independent: 391793, independent conditional: 0, independent unconditional: 391793, dependent: 2972, dependent conditional: 0, dependent unconditional: 2972, unknown: 5793, unknown conditional: 0, unknown unconditional: 5793] , Statistics on independence cache: Total cache size (in pairs): 5793, Positive cache size: 5772, Positive conditional cache size: 0, Positive unconditional cache size: 5772, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2013, Maximal queried relation: 3, Independence queries for same thread: 30687, Statistics for Abstraction: - StatisticsResult: Traversal Statistics Data States: 1228, Transitions: 1384, Traversal time: 182113412.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 38 - StatisticsResult: Traversal Statistics Data States: 16899, Transitions: 20079, Traversal time: 1982154935.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 530 - StatisticsResult: Traversal Statistics Data States: 67643, Transitions: 80458, Traversal time: 35230962217.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 2537 - StatisticsResult: Traversal Statistics Data States: 68606, Transitions: 81616, Traversal time: 915219649.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 2567 - StatisticsResult: Traversal Statistics Data States: 1732, Transitions: 2048, Traversal time: 391449495554.0ns - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - PositiveResult [Line: 1061]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1064]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1065]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 312 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 35254764.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 5525550.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 12333180.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION with 2 thread instances CFG has 5 procedures, 312 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 865482360068.0ns, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 432918736593.0ns, FeasibilityCheckTime: 432296663904.0ns, RefinementTime: 38499837.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 1520632.0ns, HoareTripleCheckerStatistics: 36 mSolverCounterUnknown, 12603 SdHoareTripleChecker+Valid, 291399243394.0ns IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12603 mSDsluCounter, 34655 SdHoareTripleChecker+Invalid, 286988632478.0ns Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 14153 IncrementalHoareTripleChecker+Unchecked, 32988 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13084 IncrementalHoareTripleChecker+Invalid, 27402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 1667 mSDtfsCounter, 13084 mSolverCounterSat, 168078604.0ns SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 75226904.0ns SsaConstructionTime, 340748945.0ns SatisfiabilityAnalysisTime, 431615336540.0ns InterpolantComputationTime, 888 NumberOfCodeBlocks, 888 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1193 ConstructedInterpolants, 183 QuantifiedInterpolants, 343990 SizeOfPredicates, 99 NumberOfNonLiveVariables, 767 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 153/411 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 312 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 13381485.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 153121.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 10719721.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 312 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 4436028.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 157901.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 1823438.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 312 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 4247911.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 155105.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 1808941.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 312 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 203518990.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 198468703.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 2710726.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 312 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 6092410.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 2526516.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 1762913.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown