/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-09 21:33:17,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-09 21:33:17,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-09 21:33:17,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-09 21:33:17,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-09 21:33:17,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-09 21:33:17,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-09 21:33:17,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-09 21:33:17,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-09 21:33:17,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-09 21:33:17,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-09 21:33:17,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-09 21:33:17,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-09 21:33:17,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-09 21:33:17,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-09 21:33:17,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-09 21:33:17,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-09 21:33:17,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-09 21:33:17,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-09 21:33:17,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-09 21:33:17,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-09 21:33:17,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-09 21:33:17,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-09 21:33:17,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-09 21:33:17,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-09 21:33:17,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-09 21:33:17,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-09 21:33:17,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-09 21:33:17,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-09 21:33:17,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-09 21:33:17,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-09 21:33:17,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-09 21:33:17,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-09 21:33:17,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-09 21:33:17,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-09 21:33:17,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-09 21:33:17,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-09 21:33:17,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-09 21:33:17,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-09 21:33:17,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-09 21:33:17,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-09 21:33:17,608 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-09 21:33:17,629 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-09 21:33:17,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-09 21:33:17,629 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-09 21:33:17,630 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-09 21:33:17,630 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-09 21:33:17,630 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-09 21:33:17,631 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-09 21:33:17,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-09 21:33:17,631 INFO L138 SettingsManager]: * Use SBE=true [2022-11-09 21:33:17,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-09 21:33:17,631 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-09 21:33:17,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-09 21:33:17,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-09 21:33:17,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-09 21:33:17,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-09 21:33:17,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-09 21:33:17,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-09 21:33:17,632 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-09 21:33:17,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-09 21:33:17,632 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-09 21:33:17,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-09 21:33:17,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-09 21:33:17,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-09 21:33:17,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-09 21:33:17,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-09 21:33:17,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 21:33:17,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-09 21:33:17,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-09 21:33:17,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-09 21:33:17,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-09 21:33:17,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-09 21:33:17,634 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-09 21:33:17,634 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-09 21:33:17,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-09 21:33:17,634 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-09 21:33:17,634 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-09 21:33:17,634 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-11-09 21:33:17,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-09 21:33:17,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-09 21:33:17,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-09 21:33:17,858 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-09 21:33:17,860 INFO L275 PluginConnector]: CDTParser initialized [2022-11-09 21:33:17,861 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 [2022-11-09 21:33:17,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c2bb8e9/de8cc47b163745ae933ffd44d347a0e2/FLAGda45ded71 [2022-11-09 21:33:18,362 INFO L306 CDTParser]: Found 1 translation units. [2022-11-09 21:33:18,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-11-09 21:33:18,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c2bb8e9/de8cc47b163745ae933ffd44d347a0e2/FLAGda45ded71 [2022-11-09 21:33:18,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c2bb8e9/de8cc47b163745ae933ffd44d347a0e2 [2022-11-09 21:33:18,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-09 21:33:18,392 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-09 21:33:18,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-09 21:33:18,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-09 21:33:18,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-09 21:33:18,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:33:18" (1/1) ... [2022-11-09 21:33:18,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dc31b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:18, skipping insertion in model container [2022-11-09 21:33:18,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:33:18" (1/1) ... [2022-11-09 21:33:18,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-09 21:33:18,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-09 21:33:18,561 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-09 21:33:18,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-11-09 21:33:18,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-11-09 21:33:18,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-11-09 21:33:18,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-11-09 21:33:18,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-11-09 21:33:18,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-11-09 21:33:18,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-11-09 21:33:18,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 21:33:18,841 INFO L203 MainTranslator]: Completed pre-run [2022-11-09 21:33:18,849 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-09 21:33:18,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-11-09 21:33:18,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-11-09 21:33:18,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-11-09 21:33:18,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-11-09 21:33:18,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-11-09 21:33:18,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-11-09 21:33:18,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-11-09 21:33:18,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 21:33:18,931 INFO L208 MainTranslator]: Completed translation [2022-11-09 21:33:18,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:18 WrapperNode [2022-11-09 21:33:18,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-09 21:33:18,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-09 21:33:18,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-09 21:33:18,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-09 21:33:18,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:18" (1/1) ... [2022-11-09 21:33:18,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:18" (1/1) ... [2022-11-09 21:33:18,999 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 345 [2022-11-09 21:33:19,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-09 21:33:19,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-09 21:33:19,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-09 21:33:19,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-09 21:33:19,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:18" (1/1) ... [2022-11-09 21:33:19,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:18" (1/1) ... [2022-11-09 21:33:19,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:18" (1/1) ... [2022-11-09 21:33:19,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:18" (1/1) ... [2022-11-09 21:33:19,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:18" (1/1) ... [2022-11-09 21:33:19,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:18" (1/1) ... [2022-11-09 21:33:19,033 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:18" (1/1) ... [2022-11-09 21:33:19,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:18" (1/1) ... [2022-11-09 21:33:19,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-09 21:33:19,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-09 21:33:19,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-09 21:33:19,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-09 21:33:19,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:18" (1/1) ... [2022-11-09 21:33:19,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 21:33:19,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:19,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-09 21:33:19,095 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-11-09 21:33:19,095 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-11-09 21:33:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-11-09 21:33:19,096 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-11-09 21:33:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-09 21:33:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-09 21:33:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-09 21:33:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-09 21:33:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-09 21:33:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-09 21:33:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-09 21:33:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-09 21:33:19,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-09 21:33:19,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-09 21:33:19,098 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-09 21:33:19,227 INFO L235 CfgBuilder]: Building ICFG [2022-11-09 21:33:19,229 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-09 21:33:19,756 INFO L276 CfgBuilder]: Performing block encoding [2022-11-09 21:33:19,763 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-09 21:33:19,763 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-09 21:33:19,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:33:19 BoogieIcfgContainer [2022-11-09 21:33:19,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-09 21:33:19,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-09 21:33:19,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-09 21:33:19,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-09 21:33:19,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:33:18" (1/3) ... [2022-11-09 21:33:19,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ec3dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:33:19, skipping insertion in model container [2022-11-09 21:33:19,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:33:18" (2/3) ... [2022-11-09 21:33:19,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ec3dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:33:19, skipping insertion in model container [2022-11-09 21:33:19,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:33:19" (3/3) ... [2022-11-09 21:33:19,771 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2022-11-09 21:33:19,776 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-09 21:33:19,788 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-09 21:33:19,788 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-11-09 21:33:19,788 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-09 21:33:19,937 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-09 21:33:19,990 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:19,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 21:33:19,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:19,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-09 21:33:19,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-09 21:33:20,015 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 21:33:20,025 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 21:33:20,029 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;@28b0930c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,029 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 21:33:20,032 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-09 21:33:20,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-09 21:33:20,038 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-09 21:33:20,040 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr0ASSERT_VIOLATIONDATA_RACE was SAFE (1/44) [2022-11-09 21:33:20,045 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 21:33:20,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:20,047 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) [2022-11-09 21:33:20,081 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 21:33:20,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr1ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 21:33:20,082 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;@28b0930c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 21:33:20,083 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-09 21:33:20,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr1ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-09 21:33:20,084 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-09 21:33:20,085 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr1ASSERT_VIOLATIONDATA_RACE was SAFE (2/44) [2022-11-09 21:33:20,089 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 21:33:20,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:20,081 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 [2022-11-09 21:33:20,093 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) [2022-11-09 21:33:20,094 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 [2022-11-09 21:33:20,097 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 21:33:20,098 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr2ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 21:33:20,098 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;@28b0930c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 21:33:20,099 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-09 21:33:20,099 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr2ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-09 21:33:20,100 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-09 21:33:20,100 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr2ASSERT_VIOLATIONDATA_RACE was SAFE (3/44) [2022-11-09 21:33:20,104 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 21:33:20,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:20,109 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) [2022-11-09 21:33:20,116 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 21:33:20,116 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr3ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 21:33:20,117 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;@28b0930c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 21:33:20,117 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-09 21:33:20,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr3ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-09 21:33:20,118 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-09 21:33:20,118 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr3ASSERT_VIOLATIONDATA_RACE was SAFE (4/44) [2022-11-09 21:33:20,122 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 21:33:20,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:20,126 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 [2022-11-09 21:33:20,127 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) [2022-11-09 21:33:20,133 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 [2022-11-09 21:33:20,134 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 21:33:20,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr4ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 21:33:20,135 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;@28b0930c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,135 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 21:33:20,135 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-09 21:33:20,135 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr4ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-09 21:33:20,136 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-09 21:33:20,137 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr4ASSERT_VIOLATIONDATA_RACE was SAFE (5/44) [2022-11-09 21:33:20,140 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 21:33:20,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:20,142 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) [2022-11-09 21:33:20,144 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 [2022-11-09 21:33:20,152 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 21:33:20,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr5ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 21:33:20,153 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;@28b0930c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 21:33:20,153 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-09 21:33:20,153 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr5ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-09 21:33:20,154 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-09 21:33:20,154 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr5ASSERT_VIOLATIONDATA_RACE was SAFE (6/44) [2022-11-09 21:33:20,158 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 21:33:20,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:20,162 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) [2022-11-09 21:33:20,163 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 [2022-11-09 21:33:20,165 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 21:33:20,165 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr6ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 21:33:20,165 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;@28b0930c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 21:33:20,166 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-09 21:33:20,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr6ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-09 21:33:20,166 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-09 21:33:20,167 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr6ASSERT_VIOLATIONDATA_RACE was SAFE (7/44) [2022-11-09 21:33:20,170 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 21:33:20,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:20,180 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-09 21:33:20,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2022-11-09 21:33:20,185 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 21:33:20,185 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr7ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 21:33:20,186 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;@28b0930c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 21:33:20,186 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-09 21:33:20,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr7ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-09 21:33:20,187 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-09 21:33:20,187 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr7ASSERT_VIOLATIONDATA_RACE was SAFE (8/44) [2022-11-09 21:33:20,190 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 21:33:20,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:20,192 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-09 21:33:20,197 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 21:33:20,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr8ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 21:33:20,198 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;@28b0930c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 21:33:20,198 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-09 21:33:20,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr8ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-09 21:33:20,199 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-09 21:33:20,199 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr8ASSERT_VIOLATIONDATA_RACE was SAFE (9/44) [2022-11-09 21:33:20,203 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 21:33:20,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:20,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2022-11-09 21:33:20,205 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-09 21:33:20,218 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 21:33:20,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr9ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 21:33:20,219 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;@28b0930c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,219 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 21:33:20,219 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-09 21:33:20,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr9ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-09 21:33:20,220 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-09 21:33:20,220 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr9ASSERT_VIOLATIONDATA_RACE was SAFE (10/44) [2022-11-09 21:33:20,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2022-11-09 21:33:20,225 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 21:33:20,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:20,235 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-09 21:33:20,241 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 21:33:20,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 21:33:20,242 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;@28b0930c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 21:33:20,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2022-11-09 21:33:20,264 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:33:20,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:33:20,268 INFO L85 PathProgramCache]: Analyzing trace with hash -310861093, now seen corresponding path program 1 times [2022-11-09 21:33:20,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:33:20,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507286436] [2022-11-09 21:33:20,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:20,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:33:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:33:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 21:33:20,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:33:20,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507286436] [2022-11-09 21:33:20,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507286436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 21:33:20,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 21:33:20,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 21:33:20,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887321590] [2022-11-09 21:33:20,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 21:33:20,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 21:33:20,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:33:20,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 21:33:20,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 21:33:20,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:20,861 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:33:20,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:33:20,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:20,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:20,900 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-09 21:33:20,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-09 21:33:20,902 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-09 21:33:20,902 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE was SAFE (11/44) [2022-11-09 21:33:20,906 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 21:33:20,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:20,924 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-09 21:33:20,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2022-11-09 21:33:20,930 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 21:33:20,930 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 21:33:20,931 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;@28b0930c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:20,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 21:33:20,941 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:33:20,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:33:20,941 INFO L85 PathProgramCache]: Analyzing trace with hash -350431602, now seen corresponding path program 1 times [2022-11-09 21:33:20,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:33:20,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962464674] [2022-11-09 21:33:20,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:20,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:33:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:33:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 21:33:21,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:33:21,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962464674] [2022-11-09 21:33:21,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962464674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 21:33:21,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 21:33:21,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 21:33:21,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517935052] [2022-11-09 21:33:21,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 21:33:21,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 21:33:21,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:33:21,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 21:33:21,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 21:33:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:21,260 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:33:21,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:33:21,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:21,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:21,312 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2022-11-09 21:33:21,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-09 21:33:21,312 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-09 21:33:21,313 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE was SAFE (12/44) [2022-11-09 21:33:21,315 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:21,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 21:33:21,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:21,327 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-09 21:33:21,332 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 21:33:21,332 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 21:33:21,333 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;@28b0930c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 21:33:21,333 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 21:33:21,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2022-11-09 21:33:21,541 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:33:21,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:33:21,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1376993376, now seen corresponding path program 1 times [2022-11-09 21:33:21,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:33:21,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599366378] [2022-11-09 21:33:21,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:21,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:33:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:33:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 21:33:21,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:33:21,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599366378] [2022-11-09 21:33:21,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599366378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 21:33:21,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 21:33:21,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-09 21:33:21,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389580822] [2022-11-09 21:33:21,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 21:33:21,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-09 21:33:21,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:33:21,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-09 21:33:21,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-09 21:33:21,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:21,588 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:33:21,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 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) [2022-11-09 21:33:21,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:21,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-09 21:33:21,609 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:33:21,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:33:21,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1506076095, now seen corresponding path program 1 times [2022-11-09 21:33:21,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:33:21,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421713401] [2022-11-09 21:33:21,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:21,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:33:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:33:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 21:33:21,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:33:21,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421713401] [2022-11-09 21:33:21,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421713401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 21:33:21,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 21:33:21,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-09 21:33:21,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999736240] [2022-11-09 21:33:21,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 21:33:21,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 21:33:21,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:33:21,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 21:33:21,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 21:33:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:21,662 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:33:21,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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) [2022-11-09 21:33:21,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:21,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:22,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-09 21:33:22,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:33:22,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:33:22,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1888324694, now seen corresponding path program 1 times [2022-11-09 21:33:22,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:33:22,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613933316] [2022-11-09 21:33:22,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:22,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:33:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:33:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 21:33:22,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:33:22,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613933316] [2022-11-09 21:33:22,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613933316] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 21:33:22,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124561213] [2022-11-09 21:33:22,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:22,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:33:22,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:22,260 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 21:33:22,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-09 21:33:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:33:22,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-09 21:33:22,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 21:33:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 21:33:22,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 21:33:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 21:33:22,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124561213] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 21:33:22,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 21:33:22,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-09 21:33:22,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372961778] [2022-11-09 21:33:22,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 21:33:22,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-09 21:33:22,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:33:22,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-09 21:33:22,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-09 21:33:22,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:22,626 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:33:22,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:33:22,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:22,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:22,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:22,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:22,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:22,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:22,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-09 21:33:22,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:33:22,910 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:33:22,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:33:22,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1692983195, now seen corresponding path program 2 times [2022-11-09 21:33:22,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:33:22,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705151017] [2022-11-09 21:33:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:22,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:33:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:33:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 21:33:23,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:33:23,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705151017] [2022-11-09 21:33:23,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705151017] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 21:33:23,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637874592] [2022-11-09 21:33:23,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-09 21:33:23,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:33:23,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:23,334 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 21:33:23,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-09 21:33:23,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-09 21:33:23,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 21:33:23,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-09 21:33:23,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 21:33:23,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-09 21:33:23,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:23,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 20 [2022-11-09 21:33:23,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:23,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:23,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 21:33:23,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-09 21:33:23,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:23,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:23,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:23,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 21:33:23,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-09 21:33:23,925 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-11-09 21:33:23,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-09 21:33:23,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637874592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 21:33:23,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-09 21:33:23,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2022-11-09 21:33:23,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712290002] [2022-11-09 21:33:23,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 21:33:23,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-09 21:33:23,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:33:23,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-09 21:33:23,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-09 21:33:23,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:23,927 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:33:23,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 23.166666666666668) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:33:23,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:23,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:23,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:23,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:33:24,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-09 21:33:24,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:33:24,386 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:33:24,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:33:24,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2143382183, now seen corresponding path program 1 times [2022-11-09 21:33:24,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:33:24,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502012236] [2022-11-09 21:33:24,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:24,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:33:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:33:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-11-09 21:33:24,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:33:24,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502012236] [2022-11-09 21:33:24,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502012236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 21:33:24,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 21:33:24,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-09 21:33:24,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302018301] [2022-11-09 21:33:24,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 21:33:24,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 21:33:24,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:33:24,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 21:33:24,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 21:33:24,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:24,622 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:33:24,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:33:24,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:24,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:24,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:24,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:33:24,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:24,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:24,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:24,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:24,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:33:24,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:24,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-09 21:33:24,709 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:33:24,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:33:24,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2052698214, now seen corresponding path program 1 times [2022-11-09 21:33:24,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:33:24,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77474609] [2022-11-09 21:33:24,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:33:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:33:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 21:33:25,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:33:25,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77474609] [2022-11-09 21:33:25,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77474609] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 21:33:25,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211198441] [2022-11-09 21:33:25,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:25,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:33:25,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:25,104 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 21:33:25,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-09 21:33:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:33:25,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 1259 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-09 21:33:25,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 21:33:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 21:33:25,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 21:33:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 21:33:25,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211198441] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 21:33:25,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 21:33:25,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-09 21:33:25,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949402886] [2022-11-09 21:33:25,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 21:33:25,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-09 21:33:25,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:33:25,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-09 21:33:25,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-11-09 21:33:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:25,910 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:33:25,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 55.27272727272727) internal successors, (608), 11 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:33:25,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:25,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:25,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:25,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:33:25,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:25,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:25,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:25,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:25,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:25,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:33:25,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:25,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:33:26,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-09 21:33:26,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:33:26,204 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:33:26,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:33:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1630498826, now seen corresponding path program 2 times [2022-11-09 21:33:26,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:33:26,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744999281] [2022-11-09 21:33:26,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:26,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:33:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:33:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1632 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2022-11-09 21:33:27,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:33:27,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744999281] [2022-11-09 21:33:27,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744999281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 21:33:27,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 21:33:27,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-09 21:33:27,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209943356] [2022-11-09 21:33:27,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 21:33:27,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 21:33:27,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:33:27,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 21:33:27,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 21:33:27,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:27,765 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:33:27,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:33:27,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:27,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:27,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:27,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:33:27,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:27,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:33:27,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:33:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:33:28,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:28,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-09 21:33:28,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:33:28,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:33:28,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1315870638, now seen corresponding path program 1 times [2022-11-09 21:33:28,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:33:28,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872279005] [2022-11-09 21:33:28,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:28,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:33:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:33:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1632 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2022-11-09 21:33:29,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:33:29,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872279005] [2022-11-09 21:33:29,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872279005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 21:33:29,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 21:33:29,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-09 21:33:29,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15010562] [2022-11-09 21:33:29,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 21:33:29,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 21:33:29,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:33:29,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 21:33:29,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 21:33:29,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:29,532 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:33:29,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:33:29,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:29,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:29,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:29,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:33:29,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:29,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:33:29,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:29,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:33:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:33:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:29,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-09 21:33:29,804 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:33:29,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:33:29,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1103856933, now seen corresponding path program 1 times [2022-11-09 21:33:29,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:33:29,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643173075] [2022-11-09 21:33:29,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:29,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:33:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:33:33,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2022-11-09 21:33:33,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:33:33,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643173075] [2022-11-09 21:33:33,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643173075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 21:33:33,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075576938] [2022-11-09 21:33:33,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:33,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:33:33,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:33:33,268 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 21:33:33,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-09 21:33:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:33:33,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 2120 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-09 21:33:33,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 21:33:33,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-09 21:33:34,008 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-09 21:33:34,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-09 21:33:34,018 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 21:33:34,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-09 21:33:39,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-09 21:33:39,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-09 21:33:39,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:39,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-09 21:33:39,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:39,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:39,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-09 21:33:39,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:39,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:39,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:39,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-09 21:33:40,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:40,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:40,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:40,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:40,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:40,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:41,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:41,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:41,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:42,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:42,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:42,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:42,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:42,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:42,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:33:42,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-09 21:33:42,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-09 21:33:42,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 34 [2022-11-09 21:33:42,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-11-09 21:33:42,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-11-09 21:33:42,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-11-09 21:33:42,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-11-09 21:33:42,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:33:42,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2022-11-09 21:33:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 383 refuted. 0 times theorem prover too weak. 1253 trivial. 0 not checked. [2022-11-09 21:33:42,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 21:33:46,291 INFO L356 Elim1Store]: treesize reduction 156, result has 31.3 percent of original size [2022-11-09 21:33:46,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 81 [2022-11-09 21:33:46,352 INFO L356 Elim1Store]: treesize reduction 156, result has 31.3 percent of original size [2022-11-09 21:33:46,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 83 [2022-11-09 21:33:46,398 INFO L356 Elim1Store]: treesize reduction 156, result has 31.3 percent of original size [2022-11-09 21:33:46,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 83 [2022-11-09 21:33:46,463 INFO L356 Elim1Store]: treesize reduction 156, result has 31.3 percent of original size [2022-11-09 21:33:46,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 83 [2022-11-09 21:33:46,484 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse5 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse1 (+ 3 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) (.cse0 (not (= (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) .cse3) 4) 16)))) (and (or .cse0 (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 .cse3) 0)) (not (= (select v_arrayElimArr_2 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0))) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2) 0) (not (= (select v_arrayElimArr_3 .cse3) 0)))) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) .cse0) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select v_arrayElimArr_4 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0))) (or .cse0 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse3) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 .cse1) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0))) .cse0)))) is different from false [2022-11-09 21:33:46,942 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset|))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse0 (+ 3 |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) (.cse1 (not (= 16 (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base|) .cse3) 4))))) (and (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse0) 0)))) .cse1) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_4 .cse0))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2) 0))) .cse1) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse3) 0)) (not (= (select v_arrayElimArr_3 .cse0) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0))) (or .cse1 (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse0) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 .cse0) 0)) (not (= (select v_arrayElimArr_2 .cse3) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_4 .cse0))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2) 0) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse3) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse0) 0)))) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 .cse0) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0))) .cse1)))) is different from false [2022-11-09 21:33:47,663 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_writer_fnThread1of1ForFork0_~arg#1.offset| 20))) (let ((.cse2 (not (= 16 (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~arg#1.base|) .cse3) 4)))) (.cse4 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse0 (+ |c_writer_fnThread1of1ForFork0_~arg#1.offset| 3)) (.cse1 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3))) (and (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse0) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0))) .cse2) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= 0 (select v_arrayElimArr_2 .cse0))) (not (= (select v_arrayElimArr_2 .cse3) 0)))) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_3 .cse0) 0)))) .cse2) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse3) 0)))) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_3 .cse3) 0)) (not (= (select v_arrayElimArr_3 .cse0) 0)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse0) 0)) (not (= (select v_arrayElimArr_4 .cse3) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0)))))) is different from false [2022-11-09 21:33:47,698 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (let ((.cse0 (not (= (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) .cse4) 4) 16))) (.cse3 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse2 (+ 3 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (and (or .cse0 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0) (not (= (select v_arrayElimArr_4 .cse2) 0))))) (or (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse2) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse3) 0))) .cse0) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse2) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse4) 0)))) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse2) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse3) 0) (not (= (select v_arrayElimArr_3 .cse4) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 .cse4) 0)) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_2 .cse2) 0)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0) (not (= (select v_arrayElimArr_4 .cse2) 0)) (not (= (select v_arrayElimArr_4 .cse4) 0))))))) is different from false [2022-11-09 21:33:48,720 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse4 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse3 (not (= (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) .cse1) 4) 16))) (.cse0 (+ 3 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2) 0) (not (= (select v_arrayElimArr_4 .cse0) 0)))) .cse3) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_3 .cse0) 0)) (not (= (select v_arrayElimArr_3 .cse1) 0)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2) 0) (not (= (select v_arrayElimArr_4 .cse0) 0)) (not (= (select v_arrayElimArr_4 .cse1) 0)))) (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_3 .cse0) 0)))) .cse3) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_2 .cse1) 0)) (not (= (select v_arrayElimArr_2 .cse0) 0))))))) is different from false [2022-11-09 21:33:48,838 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse3 (not (= (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) .cse2) 4) 16))) (.cse4 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse0 (+ 3 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse0) 0)) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0) (not (= (select v_arrayElimArr_4 .cse2) 0)))) (or .cse3 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_3 .cse0) 0))))) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse0) 0)) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0))) .cse3) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_3 .cse0) 0)) (not (= (select v_arrayElimArr_3 .cse2) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 .cse2) 0)) (= (select (select (store (store |c_#race| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_2 .cse0) 0))))))) is different from false [2022-11-09 21:33:50,055 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse4 (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (let ((.cse0 (not (= (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) .cse4) 4) 16))) (.cse3 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5 0))) (.cse1 (+ 3 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (and (or .cse0 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse3) 0)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_2 .cse4) 0)) (not (= (select v_arrayElimArr_2 .cse1) 0)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse1) 0)) (not (= (select v_arrayElimArr_4 .cse4) 0)) (= (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0))) (or .cse0 (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse1) 0)) (= (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0)))) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_3 .cse1) 0)) (= (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse3) 0) (not (= (select v_arrayElimArr_3 .cse4) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse4) 0))))))) is different from false [2022-11-09 21:33:50,099 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse5 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) (.cse1 (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (let ((.cse4 (not (= (* (select (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) .cse1) 4) 16))) (.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse3 0) .cse5 0))) (.cse2 (+ 3 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|))) (and (forall ((v_arrayElimArr_2 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_2 .cse1) 0)) (not (= (select v_arrayElimArr_2 .cse2) 0)))) (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse3) 0) (not (= (select v_arrayElimArr_3 .cse2) 0)))) .cse4) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse2) 0)) (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0) (not (= (select v_arrayElimArr_1 .cse1) 0)))) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0) (not (= (select v_arrayElimArr_4 .cse2) 0)))) .cse4) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse5) 0) (not (= (select v_arrayElimArr_4 .cse2) 0)) (not (= (select v_arrayElimArr_4 .cse1) 0)))) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_3885 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_3885) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse3) 0) (not (= (select v_arrayElimArr_3 .cse2) 0)) (not (= (select v_arrayElimArr_3 .cse1) 0))))))) is different from false [2022-11-09 21:33:50,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 21:33:50,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-09 21:33:50,412 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 21:33:50,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 64 [2022-11-09 21:33:50,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 21:33:50,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 64 [2022-11-09 21:33:50,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-09 21:33:50,475 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 21:33:50,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2022-11-09 21:33:50,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 70 [2022-11-09 21:33:50,490 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-09 21:33:50,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 46 [2022-11-09 21:33:50,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-09 21:33:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1632 trivial. 4 not checked. [2022-11-09 21:33:51,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075576938] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 21:33:51,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 21:33:51,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 30, 27] total 76 [2022-11-09 21:33:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874311774] [2022-11-09 21:33:51,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 21:33:51,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-09 21:33:51,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:33:51,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-09 21:33:51,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=4209, Unknown=149, NotChecked=1128, Total=5852 [2022-11-09 21:33:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:51,827 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:33:51,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 8.578947368421053) internal successors, (652), 77 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:33:51,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:51,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:51,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:51,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:33:51,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:51,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:33:51,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:51,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:51,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:33:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:33:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:33:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:33:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:33:56,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 21:33:56,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-09 21:33:56,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:33:56,845 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:33:56,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:33:56,846 INFO L85 PathProgramCache]: Analyzing trace with hash 331912342, now seen corresponding path program 2 times [2022-11-09 21:33:56,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:33:56,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680295773] [2022-11-09 21:33:56,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:33:56,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:33:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:34:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1667 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1635 trivial. 0 not checked. [2022-11-09 21:34:00,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:34:00,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680295773] [2022-11-09 21:34:00,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680295773] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 21:34:00,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313955682] [2022-11-09 21:34:00,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-09 21:34:00,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:34:00,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:34:00,373 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 21:34:00,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-09 21:34:01,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 21:34:01,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 21:34:01,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 2194 conjuncts, 138 conjunts are in the unsatisfiable core [2022-11-09 21:34:01,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 21:34:01,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-09 21:34:01,121 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-09 21:34:01,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-09 21:34:01,149 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 21:34:01,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-09 21:34:04,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-09 21:34:04,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:04,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-09 21:34:04,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:04,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:04,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-09 21:34:04,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:04,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:04,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:04,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-09 21:34:05,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:05,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:05,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:05,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:05,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:05,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:05,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:05,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:05,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:06,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:06,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:06,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:06,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:06,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:06,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:06,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:06,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:06,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:06,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:06,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:06,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:06,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1667 backedges. 0 proven. 411 refuted. 0 times theorem prover too weak. 1256 trivial. 0 not checked. [2022-11-09 21:34:06,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 21:34:06,598 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5043 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_5043) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) is different from false [2022-11-09 21:34:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1667 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1635 trivial. 0 not checked. [2022-11-09 21:34:09,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313955682] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 21:34:09,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 21:34:09,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28, 21] total 65 [2022-11-09 21:34:09,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164708297] [2022-11-09 21:34:09,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 21:34:09,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-09 21:34:09,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:34:09,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-09 21:34:09,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=3734, Unknown=69, NotChecked=126, Total=4290 [2022-11-09 21:34:09,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:09,373 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:34:09,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 10.661538461538461) internal successors, (693), 66 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:34:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:34:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:34:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 21:34:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:34:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:34:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 21:34:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 21:34:12,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-09 21:34:12,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:34:12,450 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:34:12,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:34:12,451 INFO L85 PathProgramCache]: Analyzing trace with hash -334966940, now seen corresponding path program 1 times [2022-11-09 21:34:12,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:34:12,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570661745] [2022-11-09 21:34:12,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:34:12,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:34:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:34:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1699 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2022-11-09 21:34:17,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:34:17,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570661745] [2022-11-09 21:34:17,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570661745] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 21:34:17,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978894804] [2022-11-09 21:34:17,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:34:17,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:34:17,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:34:17,321 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 21:34:17,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-09 21:34:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:34:18,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 2397 conjuncts, 172 conjunts are in the unsatisfiable core [2022-11-09 21:34:18,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 21:34:18,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-09 21:34:18,077 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-09 21:34:18,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-09 21:34:18,085 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 21:34:18,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-09 21:34:22,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-09 21:34:22,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:22,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-09 21:34:23,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:23,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:23,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-09 21:34:23,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:23,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:23,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:23,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-09 21:34:23,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:23,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:23,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:23,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:23,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:23,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:23,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:23,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:23,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:23,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:23,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:23,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:23,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:23,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:23,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:24,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1699 backedges. 0 proven. 438 refuted. 0 times theorem prover too weak. 1261 trivial. 0 not checked. [2022-11-09 21:34:25,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 21:34:26,661 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6305 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_6305) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6305 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_6305) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6305 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_6305) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (not (= |c_ULTIMATE.start_main_~#reader~0#1.base| |c_writer_fnThread1of1ForFork0_~r~1#1.base|)) (forall ((v_ArrVal_6305 (Array Int Int))) (= (select (select (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_6305) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) is different from false [2022-11-09 21:34:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1699 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1640 trivial. 25 not checked. [2022-11-09 21:34:29,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978894804] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 21:34:29,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 21:34:29,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30, 23] total 70 [2022-11-09 21:34:29,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818274142] [2022-11-09 21:34:29,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 21:34:29,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-09 21:34:29,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:34:29,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-09 21:34:29,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=4342, Unknown=99, NotChecked=136, Total=4970 [2022-11-09 21:34:29,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:29,766 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:34:29,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 11.742857142857142) internal successors, (822), 71 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:34:29,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:29,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:29,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:29,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:34:29,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:29,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:34:29,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:29,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:29,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 21:34:29,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 21:34:29,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:34:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:34:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 21:34:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-09 21:34:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 21:34:34,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-09 21:34:34,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:34:34,841 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:34:34,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:34:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash -836440657, now seen corresponding path program 1 times [2022-11-09 21:34:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:34:34,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072206575] [2022-11-09 21:34:34,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:34:34,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:34:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:34:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1644 trivial. 0 not checked. [2022-11-09 21:34:37,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:34:37,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072206575] [2022-11-09 21:34:37,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072206575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 21:34:37,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 21:34:37,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-09 21:34:37,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378136433] [2022-11-09 21:34:37,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 21:34:37,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-09 21:34:37,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:34:37,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-09 21:34:37,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-11-09 21:34:37,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:37,927 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:34:37,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 11.68421052631579) internal successors, (222), 20 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:34:37,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:37,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:37,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:37,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:34:37,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:37,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:34:37,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:37,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:37,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 21:34:37,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-09 21:34:37,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 21:34:37,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:34:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:34:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 21:34:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-09 21:34:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 21:34:39,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 21:34:39,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-09 21:34:39,179 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:34:39,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:34:39,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1243532603, now seen corresponding path program 1 times [2022-11-09 21:34:39,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:34:39,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575890820] [2022-11-09 21:34:39,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:34:39,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:34:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:34:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1656 trivial. 0 not checked. [2022-11-09 21:34:40,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:34:40,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575890820] [2022-11-09 21:34:40,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575890820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 21:34:40,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 21:34:40,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-09 21:34:40,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801881052] [2022-11-09 21:34:40,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 21:34:40,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 21:34:40,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:34:40,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 21:34:40,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 21:34:40,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:40,370 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:34:40,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:34:40,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:40,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:40,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:40,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:34:40,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:40,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:34:40,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:40,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:40,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 21:34:40,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-09 21:34:40,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 21:34:40,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 21:34:40,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:34:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:34:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 21:34:40,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-09 21:34:40,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 21:34:40,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 21:34:40,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:40,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-09 21:34:40,625 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:34:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:34:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash -446569654, now seen corresponding path program 1 times [2022-11-09 21:34:40,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:34:40,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851856304] [2022-11-09 21:34:40,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:34:40,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:34:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:34:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 1638 trivial. 0 not checked. [2022-11-09 21:34:45,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:34:45,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851856304] [2022-11-09 21:34:45,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851856304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 21:34:45,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632460309] [2022-11-09 21:34:45,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:34:45,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:34:45,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:34:45,611 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 21:34:45,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-09 21:34:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:34:46,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 2321 conjuncts, 164 conjunts are in the unsatisfiable core [2022-11-09 21:34:46,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 21:34:46,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-09 21:34:46,328 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-09 21:34:46,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-09 21:34:46,335 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 21:34:46,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-09 21:34:50,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-09 21:34:50,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:50,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-09 21:34:50,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:50,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:50,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-09 21:34:51,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:51,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:51,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:51,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-09 21:34:51,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:51,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:51,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:51,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:51,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:51,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:51,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:51,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:51,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:51,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:51,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:51,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:51,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:51,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:51,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:51,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:51,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:51,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:51,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:51,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:51,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:52,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:52,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:52,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:34:52,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:52,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:53,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:53,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:53,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:53,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:53,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:53,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:53,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:53,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:53,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:53,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:53,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:53,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:34:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 1256 trivial. 0 not checked. [2022-11-09 21:34:53,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 21:34:54,122 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#reader~0#1.base| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|)) (forall ((v_ArrVal_8660 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_8660) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_8660 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_8660) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_8660 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_8660) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_8660 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_8660) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0))) is different from false [2022-11-09 21:34:58,099 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8660 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_8660) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~#reader~0#1.base| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|)) (forall ((v_ArrVal_8660 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_8660) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_8660 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_8660) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_8660 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_8660) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0))) is different from false [2022-11-09 21:34:58,287 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1 0) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3) 0)))) (and (forall ((v_ArrVal_8660 (Array Int Int))) (= (select (select (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_8660) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0)) (not (= |c_ULTIMATE.start_main_~#reader~0#1.base| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|)) (forall ((v_ArrVal_8660 (Array Int Int))) (= (select (select (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_8660) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_8660 (Array Int Int))) (= (select (select (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_8660) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))))) is different from false [2022-11-09 21:34:58,379 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 21:34:58,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49 [2022-11-09 21:34:58,382 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 21:34:58,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34 [2022-11-09 21:34:58,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-09 21:34:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 0 proven. 0 refuted. 14 times theorem prover too weak. 1642 trivial. 0 not checked. [2022-11-09 21:34:59,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632460309] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 21:34:59,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 21:34:59,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31, 23] total 72 [2022-11-09 21:34:59,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17312943] [2022-11-09 21:34:59,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 21:34:59,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-09 21:34:59,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:34:59,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-09 21:34:59,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=4273, Unknown=155, NotChecked=414, Total=5256 [2022-11-09 21:34:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:59,736 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:34:59,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 10.833333333333334) internal successors, (780), 73 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:34:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:34:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:34:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:34:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:34:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 21:34:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-09 21:34:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 21:34:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 21:34:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:34:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:35:11,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:35:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:35:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:35:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:35:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:35:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:35:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:35:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:35:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-09 21:35:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-09 21:35:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-09 21:35:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 21:35:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:35:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-09 21:35:11,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-09 21:35:11,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-09 21:35:11,500 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:35:11,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:35:11,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1707117120, now seen corresponding path program 2 times [2022-11-09 21:35:11,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:35:11,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688517174] [2022-11-09 21:35:11,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:35:11,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:35:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:35:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1656 trivial. 0 not checked. [2022-11-09 21:35:16,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:35:16,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688517174] [2022-11-09 21:35:16,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688517174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 21:35:16,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 21:35:16,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-11-09 21:35:16,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861244952] [2022-11-09 21:35:16,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 21:35:16,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-09 21:35:16,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:35:16,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-09 21:35:16,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2022-11-09 21:35:16,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:35:16,254 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:35:16,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 10.666666666666666) internal successors, (256), 25 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:35:16,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:35:16,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:35:16,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:35:16,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:35:16,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:35:16,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:35:16,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:35:16,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:35:16,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-09 21:35:16,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-09 21:35:16,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-09 21:35:16,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 21:35:16,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:35:16,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-09 21:35:16,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:35:42,669 WARN L233 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 202 DAG size of output: 155 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-09 21:36:06,068 WARN L233 SmtUtils]: Spent 5.78s on a formula simplification. DAG size of input: 204 DAG size of output: 157 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-09 21:36:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:36:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:36:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:36:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:36:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:36:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:36:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:36:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:36:13,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-09 21:36:13,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 21:36:13,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-09 21:36:13,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 21:36:13,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:36:13,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-09 21:36:13,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-09 21:36:13,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-09 21:36:13,085 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:36:13,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:36:13,085 INFO L85 PathProgramCache]: Analyzing trace with hash -270423337, now seen corresponding path program 1 times [2022-11-09 21:36:13,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:36:13,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750090743] [2022-11-09 21:36:13,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:36:13,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:36:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:36:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1632 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2022-11-09 21:36:17,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:36:17,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750090743] [2022-11-09 21:36:17,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750090743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 21:36:17,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 21:36:17,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-11-09 21:36:17,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102760225] [2022-11-09 21:36:17,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 21:36:17,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-09 21:36:17,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:36:17,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-09 21:36:17,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-11-09 21:36:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:36:17,572 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:36:17,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 10.583333333333334) internal successors, (254), 25 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-09 21:36:17,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:36:30,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:36:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:36:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:36:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:36:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:36:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:36:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:36:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:36:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-09 21:36:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-09 21:36:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-09 21:36:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-09 21:36:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:36:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-09 21:36:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-09 21:36:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-09 21:36:30,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-09 21:36:30,376 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 21:36:30,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 21:36:30,376 INFO L85 PathProgramCache]: Analyzing trace with hash 18316139, now seen corresponding path program 1 times [2022-11-09 21:36:30,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 21:36:30,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723299285] [2022-11-09 21:36:30,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:36:30,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 21:36:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:36:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1642 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2022-11-09 21:36:36,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 21:36:36,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723299285] [2022-11-09 21:36:36,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723299285] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 21:36:36,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125864876] [2022-11-09 21:36:36,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 21:36:36,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:36:36,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 21:36:36,545 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 21:36:36,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-09 21:36:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 21:36:37,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 2347 conjuncts, 146 conjunts are in the unsatisfiable core [2022-11-09 21:36:37,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 21:36:37,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-09 21:36:37,474 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-09 21:36:37,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-09 21:36:37,485 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 21:36:37,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-09 21:36:42,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-09 21:36:42,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:42,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-09 21:36:42,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:42,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:42,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-09 21:36:42,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:42,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:42,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:42,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-09 21:36:43,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:43,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:43,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:43,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:43,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:43,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:43,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:43,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:43,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:43,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:43,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:43,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:43,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:43,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:43,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:43,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:43,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:43,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:43,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:43,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:43,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:43,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:43,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 21:36:43,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:44,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:44,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:44,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:44,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:44,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:44,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:44,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:44,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:45,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:45,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:45,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:45,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:45,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:45,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:45,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:45,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:46,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:46,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:46,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:46,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:46,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:46,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:46,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:46,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:46,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:46,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:46,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:46,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:46,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:47,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:47,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:47,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:47,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:47,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:47,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:48,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:48,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 21:36:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1642 backedges. 0 proven. 389 refuted. 0 times theorem prover too weak. 1253 trivial. 0 not checked. [2022-11-09 21:36:48,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 21:36:48,556 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_11080 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_11080 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_11080 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_11080 (Array Int Int))) (= (select (select (store |c_#race| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0))) is different from false [2022-11-09 21:36:48,576 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int))) (= (select (select (store (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int))) (= (select (select (store (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int))) (= (select (select (store (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int))) (= (select (select (store (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0))) is different from false [2022-11-09 21:36:48,615 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int))) (= (select (select (store (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3)) 0)) (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int))) (= (select (select (store (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0)) (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int))) (= (select (select (store (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int))) (= (select (select (store (store |c_#race| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0))) is different from false [2022-11-09 21:36:59,993 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int)) (v_ArrVal_11066 (Array Int Int)) (v_ArrVal_11043 (Array Int Int))) (= (select (select (store (store (store (store .cse0 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11043) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11066) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int)) (v_ArrVal_11066 (Array Int Int)) (v_ArrVal_11043 (Array Int Int))) (= (select (select (store (store (store (store .cse0 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11043) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11066) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) 0)) (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int)) (v_ArrVal_11066 (Array Int Int)) (v_ArrVal_11043 (Array Int Int))) (= 0 (select (select (store (store (store (store .cse0 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11043) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11066) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|))) (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int)) (v_ArrVal_11066 (Array Int Int)) (v_ArrVal_11043 (Array Int Int))) (= (select (select (store (store (store (store .cse0 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11043) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11066) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0))))) is different from false [2022-11-09 21:37:00,018 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int)) (v_ArrVal_11066 (Array Int Int)) (v_ArrVal_11043 (Array Int Int))) (= (select (select (store (store (store (store .cse0 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11043) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11066) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int)) (v_ArrVal_11066 (Array Int Int)) (v_ArrVal_11043 (Array Int Int))) (= (select (select (store (store (store (store .cse0 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11043) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11066) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) |c_ULTIMATE.start_main_~#reader~0#1.offset|) 0)) (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int)) (v_ArrVal_11066 (Array Int Int)) (v_ArrVal_11043 (Array Int Int))) (= 0 (select (select (store (store (store (store .cse0 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11043) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11066) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) .cse2))) (forall ((v_ArrVal_11080 (Array Int Int)) (v_ArrVal_11079 (Array Int Int)) (v_ArrVal_11066 (Array Int Int)) (v_ArrVal_11043 (Array Int Int))) (= (select (select (store (store (store (store .cse0 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11043) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11066) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_11079) |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_11080) |c_ULTIMATE.start_main_~#reader~0#1.base|) (+ |c_ULTIMATE.start_main_~#reader~0#1.offset| 1)) 0))))) is different from false [2022-11-09 21:37:00,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 21:37:00,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58 [2022-11-09 21:37:00,184 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 21:37:00,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1964 treesize of output 1910 [2022-11-09 21:37:00,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 915 treesize of output 851 [2022-11-09 21:37:00,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1766 treesize of output 1734 [2022-11-09 21:37:00,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1734 treesize of output 1718 [2022-11-09 21:37:00,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1718 treesize of output 1590 [2022-11-09 21:37:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1642 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1632 trivial. 5 not checked. [2022-11-09 21:37:02,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125864876] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 21:37:02,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 21:37:02,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31, 26] total 81 [2022-11-09 21:37:02,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096076281] [2022-11-09 21:37:02,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 21:37:03,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-11-09 21:37:03,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 21:37:03,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-11-09 21:37:03,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=5247, Unknown=194, NotChecked=770, Total=6642 [2022-11-09 21:37:03,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:37:03,002 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 21:37:03,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 81 states have (on average 10.419753086419753) internal successors, (844), 82 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 21:37:03,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:37:03,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:37:03,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:37:03,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-09 21:37:03,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 21:37:03,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-09 21:37:03,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:37:03,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:37:03,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-09 21:37:03,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-09 21:37:03,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-09 21:37:03,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-09 21:37:03,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 21:37:03,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-09 21:37:03,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-09 21:37:03,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-09 21:37:03,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 21:37:23,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-09 21:37:23,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 21:37:23,581 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at most one deprecated predicate at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:153) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at java.base/java.util.Iterator.forEachRemaining(Iterator.java:133) at java.base/java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEachOrdered(ReferencePipeline.java:502) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:236) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.automata.partialorder.PersistentSetReduction.applyNewStateReduction(PersistentSetReduction.java:73) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-09 21:37:23,582 INFO L158 Benchmark]: Toolchain (without parser) took 245189.63ms. Allocated memory was 184.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 154.8MB in the beginning and 577.8MB in the end (delta: -423.0MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-11-09 21:37:23,582 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-09 21:37:23,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.37ms. Allocated memory is still 184.5MB. Free memory was 154.5MB in the beginning and 133.2MB in the end (delta: 21.3MB). Peak memory consumption was 23.6MB. Max. memory is 8.0GB. [2022-11-09 21:37:23,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.77ms. Allocated memory is still 184.5MB. Free memory was 133.2MB in the beginning and 128.3MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-11-09 21:37:23,582 INFO L158 Benchmark]: Boogie Preprocessor took 37.19ms. Allocated memory is still 184.5MB. Free memory was 128.3MB in the beginning and 123.8MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-11-09 21:37:23,583 INFO L158 Benchmark]: RCFGBuilder took 726.65ms. Allocated memory was 184.5MB in the beginning and 226.5MB in the end (delta: 41.9MB). Free memory was 123.8MB in the beginning and 188.8MB in the end (delta: -65.0MB). Peak memory consumption was 36.0MB. Max. memory is 8.0GB. [2022-11-09 21:37:23,583 INFO L158 Benchmark]: TraceAbstraction took 243815.48ms. Allocated memory was 226.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 188.3MB in the beginning and 577.8MB in the end (delta: -389.6MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-11-09 21:37:23,584 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 538.37ms. Allocated memory is still 184.5MB. Free memory was 154.5MB in the beginning and 133.2MB in the end (delta: 21.3MB). Peak memory consumption was 23.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.77ms. Allocated memory is still 184.5MB. Free memory was 133.2MB in the beginning and 128.3MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.19ms. Allocated memory is still 184.5MB. Free memory was 128.3MB in the beginning and 123.8MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 726.65ms. Allocated memory was 184.5MB in the beginning and 226.5MB in the end (delta: 41.9MB). Free memory was 123.8MB in the beginning and 188.8MB in the end (delta: -65.0MB). Peak memory consumption was 36.0MB. Max. memory is 8.0GB. * TraceAbstraction took 243815.48ms. Allocated memory was 226.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 188.3MB in the beginning and 577.8MB in the end (delta: -389.6MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 40, Number of trivial persistent sets: 40, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 47, Number of trivial persistent sets: 47, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - ExceptionOrErrorResult: AssertionError: at most one deprecated predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at most one deprecated predicate: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:973) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-09 21:37:23,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Forceful destruction successful, exit code 0 [2022-11-09 21:37:23,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Ended with exit code 0 [2022-11-09 21:37:24,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Ended with exit code 0 [2022-11-09 21:37:24,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Forceful destruction successful, exit code 0 [2022-11-09 21:37:24,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Forceful destruction successful, exit code 0 [2022-11-09 21:37:24,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Forceful destruction successful, exit code 0 [2022-11-09 21:37:24,827 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 [2022-11-09 21:37:25,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Forceful destruction successful, exit code 0 [2022-11-09 21:37:25,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2022-11-09 21:37:25,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2022-11-09 21:37:25,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2022-11-09 21:37:25,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2022-11-09 21:37:26,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-11-09 21:37:26,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...