/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE -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/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-10 10:42:26,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-10 10:42:26,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-10 10:42:26,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-10 10:42:26,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-10 10:42:26,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-10 10:42:26,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-10 10:42:26,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-10 10:42:26,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-10 10:42:26,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-10 10:42:26,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-10 10:42:26,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-10 10:42:26,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-10 10:42:26,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-10 10:42:26,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-10 10:42:26,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-10 10:42:26,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-10 10:42:26,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-10 10:42:26,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-10 10:42:26,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-10 10:42:26,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-10 10:42:26,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-10 10:42:26,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-10 10:42:26,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-10 10:42:26,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-10 10:42:26,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-10 10:42:26,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-10 10:42:26,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-10 10:42:26,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-10 10:42:26,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-10 10:42:26,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-10 10:42:26,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-10 10:42:26,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-10 10:42:26,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-10 10:42:26,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-10 10:42:26,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-10 10:42:26,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-10 10:42:26,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-10 10:42:26,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-10 10:42:26,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-10 10:42:26,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-10 10:42:26,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-10 10:42:27,030 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-10 10:42:27,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-10 10:42:27,031 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-10 10:42:27,031 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-10 10:42:27,031 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-10 10:42:27,031 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-10 10:42:27,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-10 10:42:27,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-10 10:42:27,032 INFO L138 SettingsManager]: * Use SBE=true [2022-11-10 10:42:27,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-10 10:42:27,033 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-10 10:42:27,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-10 10:42:27,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-10 10:42:27,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-10 10:42:27,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-10 10:42:27,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-10 10:42:27,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-10 10:42:27,034 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-10 10:42:27,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-10 10:42:27,034 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-10 10:42:27,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-10 10:42:27,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-10 10:42:27,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-10 10:42:27,035 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-10 10:42:27,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-10 10:42:27,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 10:42:27,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-10 10:42:27,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-10 10:42:27,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-10 10:42:27,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-10 10:42:27,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-10 10:42:27,036 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-10 10:42:27,037 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-10 10:42:27,037 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-10 10:42:27,037 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-10 10:42:27,037 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-10 10:42:27,037 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-10 10:42:27,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-10 10:42:27,037 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-11-10 10:42:27,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-10 10:42:27,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-10 10:42:27,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-10 10:42:27,292 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-10 10:42:27,294 INFO L275 PluginConnector]: CDTParser initialized [2022-11-10 10:42:27,295 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2022-11-10 10:42:27,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6d6d3ac/d13364d59ac14ba38712d002f18dce9e/FLAG3b66907cf [2022-11-10 10:42:27,802 INFO L306 CDTParser]: Found 1 translation units. [2022-11-10 10:42:27,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-11-10 10:42:27,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6d6d3ac/d13364d59ac14ba38712d002f18dce9e/FLAG3b66907cf [2022-11-10 10:42:28,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6d6d3ac/d13364d59ac14ba38712d002f18dce9e [2022-11-10 10:42:28,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-10 10:42:28,104 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-10 10:42:28,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-10 10:42:28,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-10 10:42:28,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-10 10:42:28,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:42:28" (1/1) ... [2022-11-10 10:42:28,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35016575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:28, skipping insertion in model container [2022-11-10 10:42:28,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:42:28" (1/1) ... [2022-11-10 10:42:28,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-10 10:42:28,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-10 10:42:28,576 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/queue_ok.i[43266,43279] [2022-11-10 10:42:28,578 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/queue_ok.i[43543,43556] [2022-11-10 10:42:28,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 10:42:28,595 INFO L203 MainTranslator]: Completed pre-run [2022-11-10 10:42:28,652 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/queue_ok.i[43266,43279] [2022-11-10 10:42:28,654 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/queue_ok.i[43543,43556] [2022-11-10 10:42:28,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 10:42:28,709 INFO L208 MainTranslator]: Completed translation [2022-11-10 10:42:28,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:28 WrapperNode [2022-11-10 10:42:28,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-10 10:42:28,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-10 10:42:28,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-10 10:42:28,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-10 10:42:28,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:28" (1/1) ... [2022-11-10 10:42:28,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:28" (1/1) ... [2022-11-10 10:42:28,805 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 389 [2022-11-10 10:42:28,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-10 10:42:28,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-10 10:42:28,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-10 10:42:28,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-10 10:42:28,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:28" (1/1) ... [2022-11-10 10:42:28,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:28" (1/1) ... [2022-11-10 10:42:28,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:28" (1/1) ... [2022-11-10 10:42:28,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:28" (1/1) ... [2022-11-10 10:42:28,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:28" (1/1) ... [2022-11-10 10:42:28,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:28" (1/1) ... [2022-11-10 10:42:28,899 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:28" (1/1) ... [2022-11-10 10:42:28,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:28" (1/1) ... [2022-11-10 10:42:28,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-10 10:42:28,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-10 10:42:28,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-10 10:42:28,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-10 10:42:28,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:28" (1/1) ... [2022-11-10 10:42:28,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 10:42:28,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:42:28,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-10 10:42:28,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-10 10:42:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-10 10:42:28,977 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-10 10:42:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-10 10:42:28,977 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-10 10:42:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-10 10:42:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-10 10:42:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-10 10:42:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-10 10:42:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-10 10:42:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-10 10:42:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-10 10:42:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-10 10:42:28,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-10 10:42:28,980 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-10 10:42:29,171 INFO L235 CfgBuilder]: Building ICFG [2022-11-10 10:42:29,173 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-10 10:42:29,817 INFO L276 CfgBuilder]: Performing block encoding [2022-11-10 10:42:29,827 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-10 10:42:29,828 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-10 10:42:29,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:42:29 BoogieIcfgContainer [2022-11-10 10:42:29,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-10 10:42:29,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-10 10:42:29,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-10 10:42:29,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-10 10:42:29,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:42:28" (1/3) ... [2022-11-10 10:42:29,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228e9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:42:29, skipping insertion in model container [2022-11-10 10:42:29,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:28" (2/3) ... [2022-11-10 10:42:29,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228e9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:42:29, skipping insertion in model container [2022-11-10 10:42:29,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:42:29" (3/3) ... [2022-11-10 10:42:29,859 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-10 10:42:29,866 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-10 10:42:29,873 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-10 10:42:29,873 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2022-11-10 10:42:29,874 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-10 10:42:30,026 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-10 10:42:30,093 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 10:42:30,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 10:42:30,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:42:30,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 10:42:30,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-10 10:42:30,138 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 10:42:30,149 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2022-11-10 10:42:30,154 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;@6436cfc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 10:42:30,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-11-10 10:42:30,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:30,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash 307049292, now seen corresponding path program 1 times [2022-11-10 10:42:30,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:30,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321239677] [2022-11-10 10:42:30,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:30,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:30,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:30,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321239677] [2022-11-10 10:42:30,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321239677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:30,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:30,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-10 10:42:30,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166860842] [2022-11-10 10:42:30,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:30,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-10 10:42:30,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:30,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-10 10:42:30,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-10 10:42:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:30,929 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:30,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:30,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:30,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:30,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-10 10:42:30,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:30,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:30,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1033758044, now seen corresponding path program 1 times [2022-11-10 10:42:30,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:30,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802796853] [2022-11-10 10:42:30,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:30,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:31,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:31,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802796853] [2022-11-10 10:42:31,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802796853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:31,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:31,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-10 10:42:31,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599491845] [2022-11-10 10:42:31,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:31,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 10:42:31,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:31,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 10:42:31,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 10:42:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:31,128 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:31,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 54.5) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:31,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:31,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:31,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-10 10:42:31,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:31,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1799055717, now seen corresponding path program 1 times [2022-11-10 10:42:31,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:31,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419906489] [2022-11-10 10:42:31,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:31,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:31,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:31,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419906489] [2022-11-10 10:42:31,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419906489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:31,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:31,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 10:42:31,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177287040] [2022-11-10 10:42:31,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:31,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 10:42:31,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:31,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 10:42:31,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 10:42:31,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:31,374 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:31,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:31,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:31,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:31,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:31,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:31,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:31,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:31,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-10 10:42:31,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:31,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:31,472 INFO L85 PathProgramCache]: Analyzing trace with hash -847858666, now seen corresponding path program 1 times [2022-11-10 10:42:31,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:31,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940859648] [2022-11-10 10:42:31,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:31,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:32,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:32,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940859648] [2022-11-10 10:42:32,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940859648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:32,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:32,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 10:42:32,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051825687] [2022-11-10 10:42:32,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:32,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 10:42:32,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:32,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 10:42:32,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:32,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:32,138 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:32,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.4) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:32,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:32,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:32,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:32,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:32,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:32,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:32,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:32,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-10 10:42:32,319 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:32,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:32,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1013043635, now seen corresponding path program 1 times [2022-11-10 10:42:32,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:32,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702234048] [2022-11-10 10:42:32,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:32,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:32,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:32,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702234048] [2022-11-10 10:42:32,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702234048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:32,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:32,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 10:42:32,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412568281] [2022-11-10 10:42:32,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:32,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 10:42:32,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:32,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 10:42:32,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:32,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:32,952 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:32,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:32,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:32,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:32,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:32,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:32,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:33,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:33,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-10 10:42:33,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:33,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:33,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1185226040, now seen corresponding path program 1 times [2022-11-10 10:42:33,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:33,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160247895] [2022-11-10 10:42:33,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:33,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:33,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160247895] [2022-11-10 10:42:33,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160247895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:33,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:33,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 10:42:33,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569149754] [2022-11-10 10:42:33,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:33,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 10:42:33,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:33,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 10:42:33,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:33,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:33,673 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:33,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.4) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:33,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:33,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:33,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:33,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:33,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:33,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:33,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-10 10:42:33,812 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash 81553469, now seen corresponding path program 1 times [2022-11-10 10:42:33,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:33,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690651712] [2022-11-10 10:42:33,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:33,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:34,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:34,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690651712] [2022-11-10 10:42:34,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690651712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:34,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:34,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 10:42:34,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231772643] [2022-11-10 10:42:34,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:34,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 10:42:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 10:42:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:34,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:34,304 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:34,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:34,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:34,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:34,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:34,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:34,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:34,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:34,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:34,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-10 10:42:34,570 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:34,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:34,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1482711284, now seen corresponding path program 1 times [2022-11-10 10:42:34,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:34,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994694038] [2022-11-10 10:42:34,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:34,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:35,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994694038] [2022-11-10 10:42:35,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994694038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:35,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:35,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 10:42:35,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207384720] [2022-11-10 10:42:35,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:35,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 10:42:35,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:35,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 10:42:35,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:35,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:35,076 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:35,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.6) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:35,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:35,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:35,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:35,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:35,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-10 10:42:35,281 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:35,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash -360395587, now seen corresponding path program 1 times [2022-11-10 10:42:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:35,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984650256] [2022-11-10 10:42:35,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:35,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:35,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:35,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984650256] [2022-11-10 10:42:35,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984650256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:35,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:35,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 10:42:35,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874686486] [2022-11-10 10:42:35,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:35,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 10:42:35,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:35,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 10:42:35,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:35,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:35,793 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:35,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.2) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:35,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:35,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:35,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:35,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:36,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-10 10:42:36,006 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:36,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:36,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1453932820, now seen corresponding path program 1 times [2022-11-10 10:42:36,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:36,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198078904] [2022-11-10 10:42:36,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:36,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:36,173 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-10 10:42:36,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:36,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198078904] [2022-11-10 10:42:36,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198078904] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:42:36,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540375459] [2022-11-10 10:42:36,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:36,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:42:36,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:42:36,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:42:36,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-10 10:42:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:36,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-10 10:42:36,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:42:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-10 10:42:36,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-10 10:42:36,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540375459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:36,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-10 10:42:36,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-10 10:42:36,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717428054] [2022-11-10 10:42:36,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:36,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 10:42:36,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:36,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 10:42:36,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:36,426 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:36,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 95.0) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:36,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:36,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:36,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:36,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:36,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:36,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-10 10:42:36,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-10 10:42:36,727 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:36,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:36,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1050946421, now seen corresponding path program 1 times [2022-11-10 10:42:36,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:36,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174944160] [2022-11-10 10:42:36,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:36,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:36,896 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-10 10:42:36,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:36,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174944160] [2022-11-10 10:42:36,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174944160] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:42:36,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468403071] [2022-11-10 10:42:36,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:36,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:42:36,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:42:36,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:42:36,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-10 10:42:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:37,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-10 10:42:37,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:42:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-10 10:42:37,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-10 10:42:37,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468403071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:37,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-10 10:42:37,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-10 10:42:37,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637738687] [2022-11-10 10:42:37,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:37,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 10:42:37,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:37,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 10:42:37,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:37,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:37,166 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:37,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 97.5) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:37,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:37,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:37,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:37,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:37,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:37,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:37,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-10 10:42:37,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:42:37,525 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:37,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:37,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2123588399, now seen corresponding path program 1 times [2022-11-10 10:42:37,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:37,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696404364] [2022-11-10 10:42:37,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:37,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:37,690 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-10 10:42:37,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:37,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696404364] [2022-11-10 10:42:37,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696404364] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:42:37,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516369867] [2022-11-10 10:42:37,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:37,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:42:37,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:42:37,696 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:42:37,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-10 10:42:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:37,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-10 10:42:37,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:42:38,091 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-10 10:42:38,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:42:38,201 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-10 10:42:38,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516369867] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:42:38,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:42:38,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-10 10:42:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423008492] [2022-11-10 10:42:38,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:42:38,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-10 10:42:38,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:38,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-10 10:42:38,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-10 10:42:38,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:38,207 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:38,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.4) internal successors, (364), 10 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:38,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:38,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:38,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:38,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:38,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:38,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:38,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:38,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:42:38,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-10 10:42:38,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:42:38,578 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:38,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2140940803, now seen corresponding path program 2 times [2022-11-10 10:42:38,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:38,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638833796] [2022-11-10 10:42:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:38,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-11-10 10:42:39,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:39,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638833796] [2022-11-10 10:42:39,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638833796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:39,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:39,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 10:42:39,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974665729] [2022-11-10 10:42:39,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:39,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 10:42:39,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:39,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 10:42:39,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 10:42:39,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:39,005 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:39,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:39,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:39,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:42:39,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:39,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:42:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-10 10:42:39,116 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash -423553234, now seen corresponding path program 1 times [2022-11-10 10:42:39,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:39,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15835716] [2022-11-10 10:42:39,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:39,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 6 proven. 116 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-11-10 10:42:43,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:43,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15835716] [2022-11-10 10:42:43,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15835716] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:42:43,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484608838] [2022-11-10 10:42:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:43,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:42:43,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:42:43,404 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:42:43,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-10 10:42:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:43,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-10 10:42:43,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:42:44,454 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 13 treesize of output 9 [2022-11-10 10:42:44,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:42:44,539 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 16 treesize of output 18 [2022-11-10 10:42:44,745 INFO L356 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2022-11-10 10:42:44,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 34 treesize of output 30 [2022-11-10 10:42:44,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:42:44,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-10 10:42:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 144 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-10 10:42:44,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:42:45,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2257 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-11-10 10:42:45,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:42:45,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-10 10:42:45,248 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:42:45,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-10 10:42:45,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-10 10:42:45,696 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 144 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-10 10:42:45,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484608838] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:42:45,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:42:45,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12, 12] total 42 [2022-11-10 10:42:45,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444346699] [2022-11-10 10:42:45,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:42:45,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-10 10:42:45,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:45,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-10 10:42:45,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1500, Unknown=1, NotChecked=78, Total=1722 [2022-11-10 10:42:45,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:45,700 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:45,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 18.357142857142858) internal successors, (771), 42 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:45,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:45,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:45,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:45,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:45,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:45,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:45,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:45,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:45,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:45,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:45,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:45,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:42:45,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:45,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:48,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:48,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:42:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-10 10:42:48,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-10 10:42:48,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-10 10:42:48,546 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:48,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:48,547 INFO L85 PathProgramCache]: Analyzing trace with hash 148529074, now seen corresponding path program 1 times [2022-11-10 10:42:48,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:48,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410004796] [2022-11-10 10:42:48,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:48,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-10 10:42:49,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:49,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410004796] [2022-11-10 10:42:49,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410004796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:49,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:49,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 10:42:49,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254360095] [2022-11-10 10:42:49,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:49,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 10:42:49,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:49,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 10:42:49,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:49,269 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:49,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 40.2) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:49,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:49,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:49,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:49,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:49,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:49,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:49,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:49,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:49,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:49,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:49,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:49,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:42:49,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:49,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-10 10:42:49,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:42:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 10:42:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:50,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-10 10:42:50,729 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:50,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:50,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1770100021, now seen corresponding path program 1 times [2022-11-10 10:42:50,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:50,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011686286] [2022-11-10 10:42:50,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:50,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3039 backedges. 54 proven. 823 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2022-11-10 10:42:59,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:59,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011686286] [2022-11-10 10:42:59,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011686286] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:42:59,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017162129] [2022-11-10 10:42:59,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:59,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:42:59,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:42:59,808 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:42:59,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-10 10:43:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:43:00,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 2868 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-10 10:43:00,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:43:01,422 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 13 treesize of output 9 [2022-11-10 10:43:01,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:01,545 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 16 treesize of output 18 [2022-11-10 10:43:01,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:43:01,888 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:43:01,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:43:02,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:02,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:43:02,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-10 10:43:02,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:02,570 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 16 treesize of output 18 [2022-11-10 10:43:02,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:43:02,890 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-10 10:43:02,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 27 [2022-11-10 10:43:03,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:03,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:43:03,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-10 10:43:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3039 backedges. 1407 proven. 114 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2022-11-10 10:43:03,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:43:03,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3933)) .cse1)) 20))) is different from false [2022-11-10 10:43:03,532 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3933)) .cse1)) 20))) is different from false [2022-11-10 10:43:03,540 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3933)) .cse1))))) is different from false [2022-11-10 10:43:03,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3933)) .cse1)) 20))) is different from false [2022-11-10 10:43:03,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3928 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3928) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_3933)) .cse1))))) is different from false [2022-11-10 10:43:03,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3925 Int) (v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3928 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3925)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3928) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3933)) .cse1)) 20))) is different from false [2022-11-10 10:43:03,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_61| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_3925 Int) (v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3928 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_61| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3925))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3928) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_3933)) .cse1)) 20))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_61| (select .cse4 .cse3)))))) is different from false [2022-11-10 10:43:03,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3925 Int) (v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3928 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_61| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_61| (select .cse0 .cse1))) (not (= 20 (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_61| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_3925))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_3928) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_3933)) .cse3))))))) is different from false [2022-11-10 10:43:04,205 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:43:04,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 145 [2022-11-10 10:43:04,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:43:04,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 225 [2022-11-10 10:43:04,223 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 242 treesize of output 226 [2022-11-10 10:43:04,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 209 [2022-11-10 10:43:04,259 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 8 treesize of output 4 [2022-11-10 10:43:04,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:43:04,279 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 116 treesize of output 104 [2022-11-10 10:43:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3039 backedges. 1364 proven. 65 refuted. 0 times theorem prover too weak. 1518 trivial. 92 not checked. [2022-11-10 10:43:04,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017162129] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:43:04,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:43:04,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 22] total 60 [2022-11-10 10:43:04,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013622632] [2022-11-10 10:43:04,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:43:04,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-10 10:43:04,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:43:04,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-10 10:43:04,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=2386, Unknown=14, NotChecked=856, Total=3540 [2022-11-10 10:43:04,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:04,706 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:43:04,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 17.333333333333332) internal successors, (1040), 60 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:43:04,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:04,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:04,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:04,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:04,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:04,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:04,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:04,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:04,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:04,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:04,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:04,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:43:04,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:04,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 10:43:04,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:04,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:43:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 10:43:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-10 10:43:11,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-10 10:43:11,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-10 10:43:11,844 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:43:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:43:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash -2059792118, now seen corresponding path program 1 times [2022-11-10 10:43:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:43:11,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189979118] [2022-11-10 10:43:11,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:43:11,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:43:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:43:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 78 proven. 985 refuted. 0 times theorem prover too weak. 5027 trivial. 0 not checked. [2022-11-10 10:43:21,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:43:21,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189979118] [2022-11-10 10:43:21,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189979118] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:43:21,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466776993] [2022-11-10 10:43:21,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:43:21,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:43:21,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:43:21,516 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:43:21,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-10 10:43:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:43:22,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 3827 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-10 10:43:22,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:43:25,206 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 13 treesize of output 9 [2022-11-10 10:43:25,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:25,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:43:25,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:43:25,651 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:43:25,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:43:25,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:25,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:43:26,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-10 10:43:26,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:26,359 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 16 treesize of output 18 [2022-11-10 10:43:26,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:43:26,655 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-10 10:43:26,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:43:26,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:26,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:43:26,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-10 10:43:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 3839 proven. 468 refuted. 0 times theorem prover too weak. 1783 trivial. 0 not checked. [2022-11-10 10:43:26,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:43:28,232 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5929 (Array Int Int)) (v_ArrVal_5931 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5929) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| 4)) v_ArrVal_5931) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| (select .cse0 .cse1)))))) is different from false [2022-11-10 10:43:28,370 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5929 (Array Int Int)) (v_ArrVal_5926 Int) (v_ArrVal_5931 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5926) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5929) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| 4)) v_ArrVal_5931) .cse1) 20))))) is different from false [2022-11-10 10:43:28,539 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5929 (Array Int Int)) (v_ArrVal_5926 Int) (v_ArrVal_5924 Int) (v_ArrVal_5931 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5924)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5926) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5929) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| 4)) v_ArrVal_5931) .cse1)))))) is different from false [2022-11-10 10:43:28,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_86| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_86| (select .cse0 .cse1))) (forall ((v_ArrVal_5929 (Array Int Int)) (v_ArrVal_5926 Int) (v_ArrVal_5924 Int) (v_ArrVal_5931 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_86| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5924))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5926) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5929) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| 4)) v_ArrVal_5931) .cse3) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| (select .cse2 .cse3))))))))) is different from false [2022-11-10 10:43:28,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5929 (Array Int Int)) (v_ArrVal_5926 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_86| Int) (v_ArrVal_5924 Int) (v_ArrVal_5931 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_86| 4)) v_ArrVal_5924))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_5926) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5929) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_86| (select .cse2 .cse3))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_83| 4)) v_ArrVal_5931) .cse1) 20)))))) is different from false [2022-11-10 10:43:29,185 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:43:29,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 149 [2022-11-10 10:43:29,193 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:43:29,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 273 [2022-11-10 10:43:29,199 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 253 treesize of output 237 [2022-11-10 10:43:29,204 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 293 treesize of output 281 [2022-11-10 10:43:29,218 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 8 treesize of output 4 [2022-11-10 10:43:29,272 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:43:29,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 107 [2022-11-10 10:43:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 3530 proven. 419 refuted. 6 times theorem prover too weak. 1783 trivial. 352 not checked. [2022-11-10 10:43:30,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466776993] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:43:30,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:43:30,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 22] total 60 [2022-11-10 10:43:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224561935] [2022-11-10 10:43:30,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:43:30,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-10 10:43:30,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:43:30,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-10 10:43:30,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=2656, Unknown=37, NotChecked=550, Total=3540 [2022-11-10 10:43:30,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:30,228 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:43:30,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 20.016666666666666) internal successors, (1201), 60 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:43:30,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-10 10:43:30,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:40,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:43:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-10 10:43:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-10 10:43:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-10 10:43:40,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-10 10:43:40,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:43:40,856 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:43:40,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:43:40,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2134235087, now seen corresponding path program 1 times [2022-11-10 10:43:40,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:43:40,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250122603] [2022-11-10 10:43:40,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:43:40,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:43:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:43:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 13280 backedges. 905 proven. 0 refuted. 0 times theorem prover too weak. 12375 trivial. 0 not checked. [2022-11-10 10:43:56,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:43:56,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250122603] [2022-11-10 10:43:56,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250122603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:43:56,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:43:56,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-10 10:43:56,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427101224] [2022-11-10 10:43:56,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:43:56,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-10 10:43:56,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:43:56,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-10 10:43:56,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-11-10 10:43:56,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:56,840 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:43:56,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.833333333333334) internal successors, (267), 18 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:43:56,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:56,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:56,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:56,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:56,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:56,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:56,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:56,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:56,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:56,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:56,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:56,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:43:56,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:56,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-10 10:43:56,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:56,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-10 10:43:56,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-10 10:43:56,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:44:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:44:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:44:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-10 10:44:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:44:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-11-10 10:44:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:44:04,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-10 10:44:04,505 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:44:04,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:44:04,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1178823301, now seen corresponding path program 2 times [2022-11-10 10:44:04,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:44:04,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963286621] [2022-11-10 10:44:04,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:44:04,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:44:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:44:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 13584 backedges. 543 proven. 2365 refuted. 0 times theorem prover too weak. 10676 trivial. 0 not checked. [2022-11-10 10:44:27,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:44:27,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963286621] [2022-11-10 10:44:27,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963286621] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:44:27,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067675139] [2022-11-10 10:44:27,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 10:44:27,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:44:27,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:44:27,662 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:44:27,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-10 10:44:28,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-10 10:44:28,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 10:44:28,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-10 10:44:28,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:44:28,479 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 10:44:28,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 10:44:32,116 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 13 treesize of output 9 [2022-11-10 10:44:32,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:44:32,185 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:44:32,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-10 10:44:32,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:44:32,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-10 10:44:32,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 43 treesize of output 39 [2022-11-10 10:44:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 13584 backedges. 0 proven. 627 refuted. 0 times theorem prover too weak. 12957 trivial. 0 not checked. [2022-11-10 10:44:32,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:44:32,370 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10220 (Array Int Int))) (= |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 90 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_10220 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 91 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)) (forall ((v_ArrVal_10220 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)) (forall ((v_ArrVal_10220 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 89 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|))) is different from false [2022-11-10 10:44:32,379 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 91 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#race| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1 |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)))) (and (forall ((v_ArrVal_10220 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 90 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)) (forall ((v_ArrVal_10220 (Array Int Int))) (= |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1))) (forall ((v_ArrVal_10220 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 89 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)) (forall ((v_ArrVal_10220 (Array Int Int))) (= |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))))) is different from false [2022-11-10 10:44:32,393 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 90 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 91 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#race| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2 |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|) .cse1 |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)))) (and (forall ((v_ArrVal_10220 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)) (forall ((v_ArrVal_10220 (Array Int Int))) (= |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2))) (forall ((v_ArrVal_10220 (Array Int Int))) (= |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 89 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_10220 (Array Int Int))) (= |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))))))) is different from false [2022-11-10 10:44:32,408 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 89 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 90 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 91 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (store (select |c_#race| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse3 |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|) .cse2 |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|) .cse1 |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)))) (and (forall ((v_ArrVal_10220 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)) (forall ((v_ArrVal_10220 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)) (forall ((v_ArrVal_10220 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)) (forall ((v_ArrVal_10220 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10220) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse3) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|))))) is different from false [2022-11-10 10:44:32,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:44:32,418 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 37 treesize of output 53 [2022-11-10 10:44:32,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:44:32,421 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 86 treesize of output 32 [2022-11-10 10:44:32,426 INFO L356 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-10 10:44:32,427 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 37 treesize of output 1 [2022-11-10 10:44:32,434 INFO L356 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-10 10:44:32,434 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 37 treesize of output 1 [2022-11-10 10:44:32,439 INFO L356 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-10 10:44:32,439 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 37 treesize of output 1 [2022-11-10 10:44:34,316 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 10:44:34,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 10:44:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13584 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 12957 trivial. 57 not checked. [2022-11-10 10:44:34,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067675139] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:44:34,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:44:34,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11, 11] total 52 [2022-11-10 10:44:34,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258576356] [2022-11-10 10:44:34,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:44:34,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-10 10:44:34,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:44:34,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-10 10:44:34,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2159, Unknown=4, NotChecked=388, Total=2756 [2022-11-10 10:44:34,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:44:34,330 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:44:34,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 16.403846153846153) internal successors, (853), 53 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:34,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:44:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 131 states. [2022-11-10 10:44:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:44:34,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:45:08,588 WARN L233 SmtUtils]: Spent 32.58s on a formula simplification. DAG size of input: 64 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-10 10:45:30,995 WARN L233 SmtUtils]: Spent 18.48s on a formula simplification. DAG size of input: 44 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-10 10:45:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:45:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:45:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-10 10:45:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:45:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-11-10 10:45:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:45:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-10 10:45:31,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-10 10:45:31,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:45:31,394 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:45:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:45:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash -154349368, now seen corresponding path program 1 times [2022-11-10 10:45:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:45:31,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967613780] [2022-11-10 10:45:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:45:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:45:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:45:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 9 proven. 853 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2022-11-10 10:45:38,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:45:38,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967613780] [2022-11-10 10:45:38,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967613780] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:45:38,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603662693] [2022-11-10 10:45:38,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:45:38,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:45:38,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:45:38,964 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:45:38,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-10 10:45:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:45:39,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 1936 conjuncts, 105 conjunts are in the unsatisfiable core [2022-11-10 10:45:39,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:45:39,875 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 10:45:39,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 10:45:40,176 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 13 treesize of output 9 [2022-11-10 10:45:40,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:45:40,702 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 16 treesize of output 18 [2022-11-10 10:45:41,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:45:41,113 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:45:41,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:45:41,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:45:41,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:45:41,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-10 10:45:41,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:45:41,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:45:42,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:45:42,371 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:45:42,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:45:42,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:45:42,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:45:43,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-10 10:45:43,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:45:43,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:45:43,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:45:43,582 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-10 10:45:43,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 27 [2022-11-10 10:45:43,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:45:43,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:45:43,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-10 10:45:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 669 proven. 181 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-11-10 10:45:43,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:45:44,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11212 Int) (v_ArrVal_11211 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_11211) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_11212)) .cse1)) 20))) is different from false [2022-11-10 10:45:44,213 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11212 Int) (v_ArrVal_11211 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_11211) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_11212)) .cse1)) 20))) is different from false [2022-11-10 10:45:44,587 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_11212 Int) (v_ArrVal_11211 (Array Int Int)) (v_ArrVal_11208 Int)) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_11208) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_11211) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_11212)) .cse2)) 20)))))) is different from false [2022-11-10 10:45:44,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11212 Int) (v_ArrVal_11206 Int) (v_ArrVal_11211 (Array Int Int)) (v_ArrVal_11208 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_11206)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_11208) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_11211) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_11212)) .cse2)) 20)))))) is different from false [2022-11-10 10:45:44,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184| (select .cse0 .cse1))) (forall ((v_ArrVal_11212 Int) (v_ArrVal_11206 Int) (v_ArrVal_11211 (Array Int Int)) (v_ArrVal_11208 Int)) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_11206))) (let ((.cse5 (select .cse4 .cse1))) (or (not (= 20 (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_11208) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_11211) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_11212)) .cse3)))) (= .cse5 20)))))))) is different from false [2022-11-10 10:45:44,817 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11212 Int) (v_ArrVal_11206 Int) (v_ArrVal_11211 (Array Int Int)) (v_ArrVal_11208 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184|)) v_ArrVal_11206)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_11208) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_11211) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_11212)) .cse1)))) (= .cse4 20) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184| (select .cse5 .cse3)))))))) is different from false [2022-11-10 10:45:45,783 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11212 Int) (v_ArrVal_11202 Int) (v_ArrVal_11204 (Array Int Int)) (v_ArrVal_11206 Int) (v_ArrVal_11211 (Array Int Int)) (v_ArrVal_11208 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_11202)) |c_~#stored_elements~0.base| v_ArrVal_11204))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184|)) v_ArrVal_11206)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse7 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184| (select .cse0 .cse1))) (= .cse2 20) (< (+ (select .cse3 .cse4) 1) v_ArrVal_11202) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 (+ 88 |c_~#queue~0.offset|) v_ArrVal_11208) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_11211) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_11212)) .cse1) 20))))))))) is different from false [2022-11-10 10:45:46,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11212 Int) (v_ArrVal_11200 Int) (v_ArrVal_11202 Int) (v_ArrVal_11204 (Array Int Int)) (v_ArrVal_11206 Int) (v_ArrVal_11211 (Array Int Int)) (v_ArrVal_11208 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_11200) .cse6 v_ArrVal_11202)) |c_~#stored_elements~0.base| v_ArrVal_11204))) (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184|)) v_ArrVal_11206)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse4 .cse2))) (or (= 20 .cse0) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_11208) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_11211) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_11212)) .cse2))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_11202) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184| (select .cse7 .cse2)))))))))) is different from false [2022-11-10 10:45:46,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11198 Int) (v_ArrVal_11212 Int) (v_ArrVal_11200 Int) (v_ArrVal_11202 Int) (v_ArrVal_11204 (Array Int Int)) (v_ArrVal_11206 Int) (v_ArrVal_11211 (Array Int Int)) (v_ArrVal_11208 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_11198)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_11200) .cse1 v_ArrVal_11202)) |c_~#stored_elements~0.base| v_ArrVal_11204))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184|)) v_ArrVal_11206)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse7 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_11202) (= .cse2 20) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184| (select .cse3 .cse4))) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 (+ 88 |c_~#queue~0.offset|) v_ArrVal_11208) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_11211) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse4)) |c_~#queue~0.offset|) v_ArrVal_11212)) .cse4) 20))))))))) is different from false [2022-11-10 10:45:46,712 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11198 Int) (v_ArrVal_11212 Int) (v_ArrVal_11200 Int) (v_ArrVal_11202 Int) (v_ArrVal_11204 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_187| Int) (v_ArrVal_11206 Int) (v_ArrVal_11211 (Array Int Int)) (v_ArrVal_11208 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse8 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_187|) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_11198)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_11200) .cse6 v_ArrVal_11202)) |c_~#stored_elements~0.base| v_ArrVal_11204))) (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184|)) v_ArrVal_11206)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_11208) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_11211) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_11212)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_187| (select .cse5 .cse6))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184| (select .cse7 .cse1))) (= .cse4 20) (< (+ (select .cse8 .cse6) 1) v_ArrVal_11202))))))))) is different from false [2022-11-10 10:45:59,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11196 Int) (v_ArrVal_11198 Int) (v_ArrVal_11212 Int) (v_ArrVal_11200 Int) (v_ArrVal_11202 Int) (v_ArrVal_11204 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_187| Int) (v_ArrVal_11206 Int) (v_ArrVal_11211 (Array Int Int)) (v_ArrVal_11208 Int) (v_ArrVal_11197 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_11196)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_11197))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_187|) |c_~#queue~0.offset|) v_ArrVal_11198)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_11200) .cse1 v_ArrVal_11202)) |c_~#stored_elements~0.base| v_ArrVal_11204))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184|)) v_ArrVal_11206))) (let ((.cse6 (select .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_184| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_11208) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_11211) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_11212)) .cse1) 20)) (= .cse6 20) (< (+ (select .cse7 .cse1) 1) v_ArrVal_11202) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_187| (select .cse8 .cse1)))))))))))) is different from false [2022-11-10 10:45:59,243 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:45:59,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 682 treesize of output 432 [2022-11-10 10:45:59,257 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:45:59,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 739 treesize of output 733 [2022-11-10 10:45:59,265 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 536 treesize of output 488 [2022-11-10 10:45:59,278 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 545 treesize of output 537 [2022-11-10 10:45:59,286 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 647 treesize of output 607 [2022-11-10 10:45:59,344 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 8 treesize of output 4 [2022-11-10 10:45:59,498 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:45:59,499 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 212 treesize of output 208 [2022-11-10 10:45:59,927 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:45:59,928 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 25 treesize of output 43 [2022-11-10 10:46:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 669 proven. 46 refuted. 15 times theorem prover too weak. 285 trivial. 120 not checked. [2022-11-10 10:46:00,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603662693] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:46:00,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:46:00,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 30, 36] total 97 [2022-11-10 10:46:00,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755680992] [2022-11-10 10:46:00,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:46:00,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-11-10 10:46:00,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:46:00,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-11-10 10:46:00,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=771, Invalid=6481, Unknown=102, NotChecked=1958, Total=9312 [2022-11-10 10:46:00,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:46:00,114 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:46:00,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 11.845360824742269) internal successors, (1149), 97 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:46:00,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:46:00,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:00,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:00,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:00,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:00,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:00,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:00,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:00,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:00,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:00,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:00,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:46:00,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:00,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-10 10:46:00,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:00,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:46:00,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 131 states. [2022-11-10 10:46:00,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:46:00,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-10 10:46:00,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:46:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:46:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:46:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-10 10:46:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:46:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-11-10 10:46:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:46:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-10 10:46:22,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:46:22,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-10 10:46:22,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:46:22,800 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:46:22,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:46:22,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1851937335, now seen corresponding path program 3 times [2022-11-10 10:46:22,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:46:22,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21635523] [2022-11-10 10:46:22,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:46:22,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:46:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:46:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 22044 backedges. 20247 proven. 1797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:46:32,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:46:32,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21635523] [2022-11-10 10:46:32,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21635523] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:46:32,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142399231] [2022-11-10 10:46:32,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-10 10:46:32,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:46:32,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:46:32,892 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:46:32,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-10 10:46:33,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-10 10:46:33,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 10:46:33,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-10 10:46:33,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:46:33,990 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 10:46:33,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 10:46:38,979 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 13 treesize of output 9 [2022-11-10 10:46:39,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:46:39,064 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:46:39,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-10 10:46:39,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 34 treesize of output 32 [2022-11-10 10:46:39,158 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:46:39,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-10 10:46:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 22044 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 21252 trivial. 0 not checked. [2022-11-10 10:46:39,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:46:39,318 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_14806 (Array Int Int))) (= |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_14806) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 90 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_14806 (Array Int Int))) (= |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_14806) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 89 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_14806 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_14806) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|))) is different from false [2022-11-10 10:46:39,327 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 90 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#race| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1 |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)))) (and (forall ((v_ArrVal_14806 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_14806) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 89 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)) (forall ((v_ArrVal_14806 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_14806) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)) (forall ((v_ArrVal_14806 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_14806) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|))))) is different from false [2022-11-10 10:46:39,338 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 89 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 90 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#race| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1 |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|) .cse2 |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)))) (and (forall ((v_ArrVal_14806 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_14806) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)) (forall ((v_ArrVal_14806 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_14806) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1|)) (forall ((v_ArrVal_14806 (Array Int Int))) (= |c_t1Thread1of1ForFork1_enqueue_#t~nondet43#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_14806) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2)))))) is different from false [2022-11-10 10:46:39,348 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:46:39,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 43 [2022-11-10 10:46:39,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:46:39,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 28 [2022-11-10 10:46:39,358 INFO L356 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-10 10:46:39,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 1 [2022-11-10 10:46:39,363 INFO L356 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-10 10:46:39,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 1 [2022-11-10 10:46:41,965 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 10:46:41,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 10:46:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 22044 backedges. 0 proven. 744 refuted. 0 times theorem prover too weak. 21252 trivial. 48 not checked. [2022-11-10 10:46:41,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142399231] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:46:41,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:46:41,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 11, 11] total 70 [2022-11-10 10:46:41,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922542608] [2022-11-10 10:46:41,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:46:41,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-10 10:46:41,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:46:41,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-10 10:46:41,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=688, Invalid=3743, Unknown=3, NotChecked=396, Total=4830 [2022-11-10 10:46:41,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:46:41,975 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:46:41,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 36.67142857142857) internal successors, (2567), 70 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-10 10:46:41,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:46:41,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:46:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:46:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:46:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-10 10:46:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:46:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-11-10 10:46:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:46:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-10 10:46:58,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:46:58,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2022-11-10 10:46:58,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-10 10:46:59,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-10 10:46:59,028 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:46:59,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:46:59,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2021775011, now seen corresponding path program 2 times [2022-11-10 10:46:59,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:46:59,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338841272] [2022-11-10 10:46:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:46:59,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:46:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:47:47,793 INFO L134 CoverageAnalysis]: Checked inductivity of 14488 backedges. 42 proven. 7399 refuted. 0 times theorem prover too weak. 7047 trivial. 0 not checked. [2022-11-10 10:47:47,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:47:47,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338841272] [2022-11-10 10:47:47,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338841272] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:47:47,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369543938] [2022-11-10 10:47:47,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 10:47:47,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:47:47,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:47:47,796 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:47:47,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-10 10:47:48,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-10 10:47:48,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 10:47:48,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-10 10:47:48,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:47:48,935 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 10:47:48,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 10:47:54,325 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 15 treesize of output 11 [2022-11-10 10:47:54,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-10 10:47:54,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:47:54,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-10 10:47:54,443 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:47:54,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-10 10:47:54,606 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 54 treesize of output 50 [2022-11-10 10:47:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 14488 backedges. 57 proven. 19 refuted. 0 times theorem prover too weak. 14412 trivial. 0 not checked. [2022-11-10 10:47:54,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:47:54,667 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (and (forall ((v_ArrVal_17757 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17757) |c_~#stored_elements~0.base|) (+ 3 |c_~#stored_elements~0.offset| .cse0)))) (forall ((v_ArrVal_17757 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17757) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 1 .cse0)) |c_t1Thread1of1ForFork1_#t~nondet63#1|)) (forall ((v_ArrVal_17757 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17757) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| .cse0)) |c_t1Thread1of1ForFork1_#t~nondet63#1|)) (forall ((v_ArrVal_17757 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17757) |c_~#stored_elements~0.base|) (+ 2 |c_~#stored_elements~0.offset| .cse0)))))) is different from false [2022-11-10 10:47:54,790 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (let ((.cse1 (+ 3 |c_~#stored_elements~0.offset| .cse2))) (let ((.cse0 (store |c_#race| |c_~#stored_elements~0.base| (store (select |c_#race| |c_~#stored_elements~0.base|) .cse1 |c_t1Thread1of1ForFork1_#t~nondet63#1|)))) (and (forall ((v_ArrVal_17757 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17757) |c_~#stored_elements~0.base|) .cse1))) (forall ((v_ArrVal_17757 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17757) |c_~#stored_elements~0.base|) (+ 2 |c_~#stored_elements~0.offset| .cse2)) |c_t1Thread1of1ForFork1_#t~nondet63#1|)) (forall ((v_ArrVal_17757 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17757) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| .cse2)))) (forall ((v_ArrVal_17757 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17757) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 1 .cse2)) |c_t1Thread1of1ForFork1_#t~nondet63#1|)))))) is different from false [2022-11-10 10:47:54,807 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (let ((.cse2 (+ 2 |c_~#stored_elements~0.offset| .cse1)) (.cse3 (+ 3 |c_~#stored_elements~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#stored_elements~0.base| (store (store (select |c_#race| |c_~#stored_elements~0.base|) .cse2 |c_t1Thread1of1ForFork1_#t~nondet63#1|) .cse3 |c_t1Thread1of1ForFork1_#t~nondet63#1|)))) (and (forall ((v_ArrVal_17757 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17757) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| .cse1)) |c_t1Thread1of1ForFork1_#t~nondet63#1|)) (forall ((v_ArrVal_17757 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17757) |c_~#stored_elements~0.base|) .cse2))) (forall ((v_ArrVal_17757 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17757) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 1 .cse1)))) (forall ((v_ArrVal_17757 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17757) |c_~#stored_elements~0.base|) .cse3))))))) is different from false [2022-11-10 10:47:54,951 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:47:54,952 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 51 treesize of output 67 [2022-11-10 10:47:54,956 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:47:54,956 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 111 treesize of output 35 [2022-11-10 10:47:54,963 INFO L356 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-10 10:47:54,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2022-11-10 10:47:54,974 INFO L356 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-10 10:47:54,975 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 51 treesize of output 1 [2022-11-10 10:47:54,979 INFO L356 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-10 10:47:54,980 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 51 treesize of output 1 [2022-11-10 10:47:57,544 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 10:47:57,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-10 10:47:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 14488 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 14412 trivial. 38 not checked. [2022-11-10 10:47:57,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369543938] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:47:57,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:47:57,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 9, 9] total 67 [2022-11-10 10:47:57,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139283930] [2022-11-10 10:47:57,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:47:57,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-10 10:47:57,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:47:57,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-10 10:47:57,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=3683, Unknown=48, NotChecked=384, Total=4556 [2022-11-10 10:47:57,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:47:57,559 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:47:57,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 16.313432835820894) internal successors, (1093), 68 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-10 10:47:57,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:47:57,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 247 states. [2022-11-10 10:47:57,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:48:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:48:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:48:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:48:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:48:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:48:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2022-11-10 10:48:06,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-10 10:48:06,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-10 10:48:06,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-10 10:48:06,294 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:48:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:48:06,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1041895198, now seen corresponding path program 1 times [2022-11-10 10:48:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:48:06,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707356398] [2022-11-10 10:48:06,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:48:06,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:48:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:48:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 14488 backedges. 0 proven. 7441 refuted. 0 times theorem prover too weak. 7047 trivial. 0 not checked. [2022-11-10 10:48:55,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:48:55,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707356398] [2022-11-10 10:48:55,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707356398] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:48:55,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298776604] [2022-11-10 10:48:55,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:48:55,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:48:55,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:48:55,913 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:48:55,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-10 10:48:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:48:57,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 5619 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-10 10:48:57,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:49:04,775 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 13 treesize of output 9 [2022-11-10 10:49:04,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:49:04,957 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 16 treesize of output 18 [2022-11-10 10:49:05,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:49:05,487 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:49:05,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:49:05,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:49:05,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:49:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-10 10:49:06,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:49:06,708 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 16 treesize of output 18 [2022-11-10 10:49:07,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:49:07,135 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:49:07,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:49:07,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:49:07,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:49:07,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-10 10:49:07,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:49:07,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 16 treesize of output 18 [2022-11-10 10:49:08,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:49:08,092 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:49:08,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:49:08,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:49:08,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:49:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-10 10:49:08,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:49:08,758 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 16 treesize of output 18 [2022-11-10 10:49:09,016 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-10 10:49:09,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 27 [2022-11-10 10:49:09,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:49:09,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-10 10:49:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 14488 backedges. 6974 proven. 1260 refuted. 0 times theorem prover too weak. 6254 trivial. 0 not checked. [2022-11-10 10:49:09,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:49:09,588 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_20725 (Array Int Int)) (v_ArrVal_20726 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_20725) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_20726)) .cse1))))) is different from false [2022-11-10 10:49:09,782 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_20725 (Array Int Int)) (v_ArrVal_20721 Int) (v_ArrVal_20726 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_20721) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20725) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_20726)) .cse1)) 20))) is different from false [2022-11-10 10:49:09,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_20725 (Array Int Int)) (v_ArrVal_20721 Int) (v_ArrVal_20720 Int) (v_ArrVal_20726 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_20720)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_20721) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20725) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_20726)) .cse1)) 20))) is different from false [2022-11-10 10:49:09,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| (select .cse0 .cse1))) (forall ((v_ArrVal_20725 (Array Int Int)) (v_ArrVal_20721 Int) (v_ArrVal_20720 Int) (v_ArrVal_20726 Int)) (not (= 20 (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337|)) v_ArrVal_20720))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_20721) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20725) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_20726)) .cse3)))))))) is different from false [2022-11-10 10:49:09,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_20725 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| Int) (v_ArrVal_20721 Int) (v_ArrVal_20720 Int) (v_ArrVal_20726 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| (select .cse0 .cse1))) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337|)) v_ArrVal_20720))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_20721) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20725) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_20726)) .cse3)) 20))))) is different from false [2022-11-10 10:49:10,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_20725 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| Int) (v_ArrVal_20721 Int) (v_ArrVal_20720 Int) (v_ArrVal_20726 Int) (v_ArrVal_20714 Int) (v_ArrVal_20718 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_20714) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20718))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337|)) v_ArrVal_20720))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_20721) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20725) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_20726)) .cse1) 20)))))) is different from false [2022-11-10 10:49:10,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_20725 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| Int) (v_ArrVal_20721 Int) (v_ArrVal_20720 Int) (v_ArrVal_20726 Int) (v_ArrVal_20714 Int) (v_ArrVal_20712 Int) (v_ArrVal_20718 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_20712)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_20714) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20718))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337|)) v_ArrVal_20720))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_20721) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20725) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_20726)) .cse1) 20)))))) is different from false [2022-11-10 10:49:11,067 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340| (select .cse0 .cse1))) (forall ((v_ArrVal_20725 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| Int) (v_ArrVal_20721 Int) (v_ArrVal_20720 Int) (v_ArrVal_20726 Int) (v_ArrVal_20714 Int) (v_ArrVal_20712 Int) (v_ArrVal_20718 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_20712))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_20714) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20718))) (let ((.cse6 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337|)) v_ArrVal_20720))) (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_20721) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20725) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) v_ArrVal_20726)) .cse3) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| (select .cse6 .cse3)))))))))) is different from false [2022-11-10 10:49:11,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_20725 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| Int) (v_ArrVal_20721 Int) (v_ArrVal_20720 Int) (v_ArrVal_20726 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340| Int) (v_ArrVal_20714 Int) (v_ArrVal_20712 Int) (v_ArrVal_20718 (Array Int Int))) (let ((.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse7 (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340|)) v_ArrVal_20712))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_20714) .cse6 (+ (select .cse7 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20718))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337|)) v_ArrVal_20720))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_20721) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20725) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse1)) |c_~#queue~0.offset|) v_ArrVal_20726)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340| (select .cse5 .cse6)))))))) is different from false [2022-11-10 10:49:12,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_20707 Int) (v_ArrVal_20725 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| Int) (v_ArrVal_20711 (Array Int Int)) (v_ArrVal_20721 Int) (v_ArrVal_20720 Int) (v_ArrVal_20726 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340| Int) (v_ArrVal_20714 Int) (v_ArrVal_20712 Int) (v_ArrVal_20718 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_20707) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20711))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340|) |c_~#queue~0.offset|) v_ArrVal_20712))) (store (store .cse8 .cse5 v_ArrVal_20714) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20718))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340| (select .cse0 .cse1))) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337|)) v_ArrVal_20720))) (store (store .cse4 .cse5 v_ArrVal_20721) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20725) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_20726)) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| (select .cse6 .cse1))))))))) is different from false [2022-11-10 10:49:13,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_20707 Int) (v_ArrVal_20706 Int) (v_ArrVal_20721 Int) (v_ArrVal_20720 Int) (v_ArrVal_20726 Int) (v_ArrVal_20714 Int) (v_ArrVal_20712 Int) (v_ArrVal_20725 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| Int) (v_ArrVal_20711 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340| Int) (v_ArrVal_20718 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_20706)) (.cse10 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_20707) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20711))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340|) |c_~#queue~0.offset|) v_ArrVal_20712))) (store (store .cse8 .cse6 v_ArrVal_20714) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20718))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| (select .cse2 .cse1))) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337|)) v_ArrVal_20720))) (store (store .cse5 .cse6 v_ArrVal_20721) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20725) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_20726)) .cse1) 20)))))))) is different from false [2022-11-10 10:49:13,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_343| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_343| (select .cse0 .cse1))) (forall ((v_ArrVal_20707 Int) (v_ArrVal_20706 Int) (v_ArrVal_20721 Int) (v_ArrVal_20720 Int) (v_ArrVal_20726 Int) (v_ArrVal_20714 Int) (v_ArrVal_20712 Int) (v_ArrVal_20725 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| Int) (v_ArrVal_20711 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340| Int) (v_ArrVal_20718 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse11 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_343|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_20706))) (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_20707) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20711))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340|) |c_~#queue~0.offset|) v_ArrVal_20712))) (store (store .cse10 .cse7 v_ArrVal_20714) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20718))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| (select .cse2 .cse3))) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337|)) v_ArrVal_20720))) (store (store .cse6 .cse7 v_ArrVal_20721) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20725) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_20726)) .cse3) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340| (select .cse8 .cse3)))))))))))) is different from false [2022-11-10 10:49:13,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_20707 Int) (v_ArrVal_20706 Int) (v_ArrVal_20721 Int) (v_ArrVal_20720 Int) (v_ArrVal_20726 Int) (v_ArrVal_20714 Int) (v_ArrVal_20712 Int) (v_ArrVal_20725 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| Int) (v_ArrVal_20711 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_343| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340| Int) (v_ArrVal_20718 (Array Int Int))) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse11 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_343|)) v_ArrVal_20706))) (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_20707) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20711))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340|) |c_~#queue~0.offset|) v_ArrVal_20712))) (store (store .cse10 .cse8 v_ArrVal_20714) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20718))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_343| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_340| (select .cse4 .cse3))) (not (= 20 (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_337|)) v_ArrVal_20720))) (store (store .cse7 .cse8 v_ArrVal_20721) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_20725) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_20726)) .cse3)))))))))) is different from false [2022-11-10 10:49:14,209 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:49:14,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2165 treesize of output 1505 [2022-11-10 10:49:14,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:49:14,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1857 treesize of output 1831 [2022-11-10 10:49:14,246 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 1892 treesize of output 1868 [2022-11-10 10:49:14,261 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 1647 treesize of output 1551 [2022-11-10 10:49:14,275 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 1913 treesize of output 1849 [2022-11-10 10:49:14,288 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 1964 treesize of output 1924 [2022-11-10 10:49:14,341 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 8 treesize of output 4 [2022-11-10 10:49:14,410 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:49:14,410 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 531 treesize of output 511 [2022-11-10 10:49:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 14488 backedges. 5551 proven. 1111 refuted. 263 times theorem prover too weak. 6254 trivial. 1309 not checked. [2022-11-10 10:49:18,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298776604] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:49:18,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:49:18,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 30, 40] total 120 [2022-11-10 10:49:18,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498300176] [2022-11-10 10:49:18,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:49:18,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 120 states [2022-11-10 10:49:18,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:49:18,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2022-11-10 10:49:18,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=10057, Unknown=145, NotChecked=2886, Total=14280 [2022-11-10 10:49:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:49:18,377 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:49:18,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 120 states, 120 states have (on average 15.825) internal successors, (1899), 120 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:49:18,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:49:18,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:49:18,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:49:18,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:49:18,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:49:18,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 247 states. [2022-11-10 10:49:18,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-10 10:49:18,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:50:01,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:50:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-11-10 10:50:01,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:50:01,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-10 10:50:01,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:50:01,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2022-11-10 10:50:01,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-10 10:50:01,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2022-11-10 10:50:01,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-10 10:50:01,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-10 10:50:01,628 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:50:01,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:50:01,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1713467434, now seen corresponding path program 1 times [2022-11-10 10:50:01,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:50:01,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897347169] [2022-11-10 10:50:01,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:50:01,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:50:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:50:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 14758 backedges. 10212 proven. 2456 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2022-11-10 10:50:55,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:50:55,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897347169] [2022-11-10 10:50:55,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897347169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:50:55,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237916158] [2022-11-10 10:50:55,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:50:55,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:50:55,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:50:55,063 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:50:55,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-10 10:50:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:50:57,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 5633 conjuncts, 179 conjunts are in the unsatisfiable core [2022-11-10 10:50:57,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:50:57,581 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 10:50:57,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 10:50:57,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-10 10:50:57,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:50:58,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 25 treesize of output 25 [2022-11-10 10:50:58,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:50:58,873 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-10 10:50:58,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-10 10:50:59,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:50:59,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:50:59,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-11-10 10:50:59,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-10 10:50:59,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:50:59,502 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 16 treesize of output 18 [2022-11-10 10:50:59,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:50:59,841 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:50:59,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:50:59,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:50:59,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:51:00,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-10 10:51:00,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:51:00,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:51:00,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:51:00,870 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:51:00,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:51:01,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:51:01,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:51:01,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-10 10:51:01,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:51:01,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:51:02,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:51:02,164 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:51:02,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:51:02,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:51:02,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 23 treesize of output 22 [2022-11-10 10:51:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-10 10:51:03,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:51:03,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:51:03,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:51:03,815 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:51:03,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:51:04,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:51:04,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:51:04,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-10 10:51:05,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:51:05,187 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 16 treesize of output 18 [2022-11-10 10:51:05,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:51:05,605 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-10 10:51:05,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 27 [2022-11-10 10:51:05,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:51:05,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:51:05,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-10 10:51:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 14758 backedges. 6391 proven. 1075 refuted. 0 times theorem prover too weak. 7292 trivial. 0 not checked. [2022-11-10 10:51:05,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:51:06,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse1)) 20))) is different from false [2022-11-10 10:51:06,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_23723)) .cse1)) 20))) is different from false [2022-11-10 10:51:06,662 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_23723)) .cse1)) 20))) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem44#1| 20)) is different from false [2022-11-10 10:51:06,731 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_23723)) .cse1)) 20))) (= .cse4 20)))) is different from false [2022-11-10 10:51:06,771 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23718 Int)) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23718) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse2)) 20)))))) is different from false [2022-11-10 10:51:06,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23715)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23718) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_23723)) .cse1)) 20)) (= .cse4 20))))) is different from false [2022-11-10 10:51:06,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse0 .cse1))) (forall ((v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int)) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23715))) (let ((.cse2 (select .cse5 .cse1))) (or (= .cse2 20) (not (= 20 (let ((.cse4 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23718) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_23723)) .cse4))))))))))) is different from false [2022-11-10 10:51:06,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 20) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse1 .cse2))) (not (= (let ((.cse4 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_23718) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse4)) 20))))))) is different from false [2022-11-10 10:51:08,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (v_ArrVal_23714 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23708)) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23711) .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 20) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse1 .cse2))) (not (= 20 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_23718) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) v_ArrVal_23723)) .cse2))))))))) is different from false [2022-11-10 10:51:09,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23714 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int)) (let ((.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse8 (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_23711) .cse6 (+ (select .cse8 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_23718) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_23723)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse5 .cse6))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse7 .cse1))) (= .cse4 20)))))))) is different from false [2022-11-10 10:51:10,402 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (v_ArrVal_23707 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23714 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse9 .cse6 v_ArrVal_23711) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse7 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse2 .cse1))) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_23718) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse1) 20)) (= 20 .cse7))))))))) is different from false [2022-11-10 10:51:11,069 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (v_ArrVal_23707 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23714 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23704) .cse11 (+ (select .cse10 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse9 .cse7 v_ArrVal_23711) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse3 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse2 .cse1))) (= 20 .cse3) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_23718) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse1) 20)))))))))) is different from false [2022-11-10 10:51:11,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23714 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse10 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23702)) (.cse11 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23704) .cse11 (+ 1 (select .cse10 .cse11))))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse9 .cse5 v_ArrVal_23711) .cse2 (+ (select .cse9 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_23718) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse2) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse6 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse7 .cse2))))))))))) is different from false [2022-11-10 10:51:11,537 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| Int)) (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23714 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse10 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23702))) (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23704) .cse11 (+ (select .cse10 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse9 .cse6 v_ArrVal_23711) .cse2 (+ (select .cse9 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 20) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_23718) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse2) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse7 .cse2))))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| (select .cse12 .cse11)))))) is different from false [2022-11-10 10:51:11,601 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23714 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| Int)) (let ((.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse12 (store .cse8 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440|)) v_ArrVal_23702))) (store (store .cse12 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_23704) .cse9 (+ (select .cse12 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse11 .cse4 v_ArrVal_23711) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_23718) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| (select .cse8 .cse9))) (= 20 .cse5)))))))))) is different from false [2022-11-10 10:51:13,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23714 (Array Int Int)) (v_ArrVal_23700 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_23700))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440|)) v_ArrVal_23702))) (store (store .cse12 .cse4 v_ArrVal_23704) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse10 .cse4 v_ArrVal_23711) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_23718) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| (select .cse8 .cse1))) (= .cse5 20))))))))))) is different from false [2022-11-10 10:51:13,233 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23714 (Array Int Int)) (v_ArrVal_23700 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse14 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse13 .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23700))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440|)) v_ArrVal_23702))) (store (store .cse12 .cse5 v_ArrVal_23704) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse10 .cse5 v_ArrVal_23711) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse6 (select .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_23718) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| (select .cse8 .cse1))) (= .cse6 20))))))))))) is different from false [2022-11-10 10:51:13,764 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23696 Int) (v_ArrVal_23714 (Array Int Int)) (v_ArrVal_23700 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse14 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse13 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23696) .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23700))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440|)) v_ArrVal_23702))) (store (store .cse12 .cse7 v_ArrVal_23704) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse10 .cse7 v_ArrVal_23711) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse2 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| (select .cse0 .cse1))) (= .cse2 20) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse3 .cse1))) (not (= 20 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_23718) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse8 .cse1))))))))))))) is different from false [2022-11-10 10:51:14,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (v_ArrVal_23694 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23696 Int) (v_ArrVal_23714 (Array Int Int)) (v_ArrVal_23700 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse13 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23694)) (.cse14 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse13 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23696) .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23700))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440|)) v_ArrVal_23702))) (store (store .cse12 .cse8 v_ArrVal_23704) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse10 .cse8 v_ArrVal_23711) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse4 (select .cse7 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse3 .cse1))) (= .cse4 20) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_23718) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse1) 20)))))))))))) is different from false [2022-11-10 10:51:14,406 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443| Int)) (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse14 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (v_ArrVal_23694 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23696 Int) (v_ArrVal_23714 (Array Int Int)) (v_ArrVal_23700 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse13 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23694))) (store (store .cse13 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23696) .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23700))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440|)) v_ArrVal_23702))) (store (store .cse12 .cse7 v_ArrVal_23704) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse10 .cse7 v_ArrVal_23711) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse3 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse2 .cse1))) (= .cse3 20) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_23718) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse1)) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| (select .cse8 .cse1))))))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443| (select .cse15 .cse14)))))) is different from false [2022-11-10 10:51:14,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (v_ArrVal_23694 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23696 Int) (v_ArrVal_23714 (Array Int Int)) (v_ArrVal_23700 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| Int)) (let ((.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse15 (store .cse9 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443|)) v_ArrVal_23694))) (store (store .cse15 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_23696) .cse10 (+ (select .cse15 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23700))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select .cse13 |c_~#queue~0.base|))) (let ((.cse11 (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440|)) v_ArrVal_23702))) (store (store .cse14 .cse8 v_ArrVal_23704) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse12 .cse8 v_ArrVal_23711) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse3 (select .cse7 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse2 .cse1))) (= 20 .cse3) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| (select .cse4 .cse1))) (not (= (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_23718) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443| (select .cse9 .cse10)))))))))))))) is different from false [2022-11-10 10:51:18,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23693 (Array Int Int)) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (v_ArrVal_23694 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23696 Int) (v_ArrVal_23714 (Array Int Int)) (v_ArrVal_23700 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| Int) (v_ArrVal_23690 Int)) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse17 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse16 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23690) .cse17 (+ (select .cse16 .cse17) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23693))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse14 |c_~#queue~0.base|))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443|)) v_ArrVal_23694))) (store (store .cse15 .cse7 v_ArrVal_23696) .cse1 (+ (select .cse15 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23700))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440|)) v_ArrVal_23702))) (store (store .cse13 .cse7 v_ArrVal_23704) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse11 .cse7 v_ArrVal_23711) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse2 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse0 .cse1))) (= 20 .cse2) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443| (select .cse3 .cse1))) (not (= 20 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_23718) .cse1 (+ 1 .cse2))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| (select .cse9 .cse1))))))))))))))) is different from false [2022-11-10 10:51:18,683 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23693 (Array Int Int)) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (v_ArrVal_23694 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23696 Int) (v_ArrVal_23714 (Array Int Int)) (v_ArrVal_23700 (Array Int Int)) (v_ArrVal_23688 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| Int) (v_ArrVal_23690 Int)) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse16 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23688)) (.cse17 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse16 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23690) .cse17 (+ (select .cse16 .cse17) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23693))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (select .cse14 |c_~#queue~0.base|))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443|)) v_ArrVal_23694))) (store (store .cse15 .cse5 v_ArrVal_23696) .cse1 (+ (select .cse15 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23700))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440|)) v_ArrVal_23702))) (store (store .cse13 .cse5 v_ArrVal_23704) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse11 .cse5 v_ArrVal_23711) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse9 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse6 (select .cse4 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_23718) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443| (select .cse8 .cse1))) (= .cse6 20) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse9 .cse1))))))))))))))) is different from false [2022-11-10 10:51:18,959 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_446| Int)) (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse17 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23693 (Array Int Int)) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (v_ArrVal_23694 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23696 Int) (v_ArrVal_23714 (Array Int Int)) (v_ArrVal_23700 (Array Int Int)) (v_ArrVal_23688 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| Int) (v_ArrVal_23690 Int)) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse16 (store .cse18 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_446|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23688))) (store (store .cse16 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23690) .cse17 (+ (select .cse16 .cse17) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23693))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse9 (select .cse14 |c_~#queue~0.base|))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443|)) v_ArrVal_23694))) (store (store .cse15 .cse7 v_ArrVal_23696) .cse1 (+ (select .cse15 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23700))) (let ((.cse3 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440|)) v_ArrVal_23702))) (store (store .cse13 .cse7 v_ArrVal_23704) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse11 .cse7 v_ArrVal_23711) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse8 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| (select .cse3 .cse1))) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_23718) .cse1 (+ 1 .cse8))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse1)) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse1) 20)) (= 20 .cse8) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443| (select .cse9 .cse1))))))))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_446| (select .cse18 .cse17)))))) is different from false [2022-11-10 10:51:19,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23693 (Array Int Int)) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (v_ArrVal_23694 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_446| Int) (v_ArrVal_23696 Int) (v_ArrVal_23714 (Array Int Int)) (v_ArrVal_23700 (Array Int Int)) (v_ArrVal_23688 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| Int) (v_ArrVal_23690 Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse18 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_446|) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_23688))) (store (store .cse18 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_23690) .cse3 (+ (select .cse18 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23693))) (let ((.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select .cse16 |c_~#queue~0.base|))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (let ((.cse17 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443|)) v_ArrVal_23694))) (store (store .cse17 .cse9 v_ArrVal_23696) .cse1 (+ (select .cse17 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23700))) (let ((.cse11 (select .cse14 |c_~#queue~0.base|))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse11 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440|)) v_ArrVal_23702))) (store (store .cse15 .cse9 v_ArrVal_23704) .cse1 (+ (select .cse15 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse13 .cse9 v_ArrVal_23711) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse10 (select .cse8 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_446| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse5 .cse1))) (not (= (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_23718) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) v_ArrVal_23723)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| (select .cse11 .cse1))) (= .cse10 20)))))))))))))) is different from false [2022-11-10 10:51:23,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23686 (Array Int Int)) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23693 (Array Int Int)) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (v_ArrVal_23694 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_446| Int) (v_ArrVal_23696 Int) (v_ArrVal_23714 (Array Int Int)) (v_ArrVal_23700 (Array Int Int)) (v_ArrVal_23688 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| Int) (v_ArrVal_23690 Int)) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) 0)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_23686))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select .cse17 |c_~#queue~0.base|))) (let ((.cse15 (store (store .cse17 |c_~#queue~0.base| (let ((.cse18 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_446|) |c_~#queue~0.offset|) v_ArrVal_23688))) (store (store .cse18 .cse7 v_ArrVal_23690) .cse2 (+ (select .cse18 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23693))) (let ((.cse10 (select .cse15 |c_~#queue~0.base|))) (let ((.cse13 (store (store .cse15 |c_~#queue~0.base| (let ((.cse16 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443|)) v_ArrVal_23694))) (store (store .cse16 .cse7 v_ArrVal_23696) .cse2 (+ (select .cse16 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23700))) (let ((.cse9 (select .cse13 |c_~#queue~0.base|))) (let ((.cse11 (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440|)) v_ArrVal_23702))) (store (store .cse14 .cse7 v_ArrVal_23704) .cse2 (+ (select .cse14 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse12 .cse7 v_ArrVal_23711) .cse2 (+ (select .cse12 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse0 (select .cse6 .cse2))) (or (= .cse0 20) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_446| (select .cse1 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse3 .cse2))) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_23718) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse2) 4)) v_ArrVal_23723)) .cse2) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse8 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| (select .cse9 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_443| (select .cse10 .cse2))))))))))))))))) is different from false [2022-11-10 10:51:23,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:51:23,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26074 treesize of output 15774 [2022-11-10 10:51:23,698 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:51:23,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14036 treesize of output 13880 [2022-11-10 10:51:23,734 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 9302 treesize of output 8918 [2022-11-10 10:51:23,770 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 13394 treesize of output 13074 [2022-11-10 10:51:23,814 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 13704 treesize of output 13512 [2022-11-10 10:51:23,872 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 13458 treesize of output 13346 [2022-11-10 10:51:23,976 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 10574 treesize of output 10538 [2022-11-10 10:51:24,047 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 10583 treesize of output 10519 [2022-11-10 10:51:24,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-10 10:51:47,682 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:51:47,683 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 2124 treesize of output 2098 [2022-11-10 10:51:50,686 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:51:50,687 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 25 treesize of output 43 [2022-11-10 10:51:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14758 backedges. 6391 proven. 388 refuted. 88 times theorem prover too weak. 7292 trivial. 599 not checked. [2022-11-10 10:51:50,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237916158] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:51:50,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:51:50,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 49, 63] total 166 [2022-11-10 10:51:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025168446] [2022-11-10 10:51:50,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:51:50,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 166 states [2022-11-10 10:51:50,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:51:50,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2022-11-10 10:51:50,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2796, Invalid=16524, Unknown=244, NotChecked=7826, Total=27390 [2022-11-10 10:51:50,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:51:50,814 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:51:50,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 166 states, 166 states have (on average 12.698795180722891) internal successors, (2108), 166 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-10 10:51:50,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-10 10:51:50,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 247 states. [2022-11-10 10:51:50,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-10 10:51:50,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 173 states. [2022-11-10 10:51:50,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:54:32,439 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse23 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse14 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse14 .cse3)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse22 (select .cse21 .cse23))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_23723 Int)) (not (= (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (select (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_23723)) .cse1)) 20))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (not (= 7 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (forall ((v_ArrVal_23708 Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23702 Int) (v_ArrVal_23704 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int) (v_ArrVal_23707 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23714 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (store .cse14 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440|)) v_ArrVal_23702))) (store (store .cse13 .cse9 v_ArrVal_23704) .cse3 (+ (select .cse13 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse12 .cse9 v_ArrVal_23711) .cse3 (+ (select .cse12 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse10 (select .cse8 .cse3))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_440| .cse5)) (not (= (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_23718) .cse3 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse3) 20)) (= 20 .cse10))))))))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (forall ((v_ArrVal_23708 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23714 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int)) (let ((.cse16 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse20 (store .cse14 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse20 .cse9 v_ArrVal_23711) .cse3 (+ (select .cse20 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse19 (select .cse16 |c_~#queue~0.base|))) (let ((.cse17 (store .cse19 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse18 (select .cse17 .cse3))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| .cse5)) (not (= (select (let ((.cse15 (select (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse9 v_ArrVal_23718) .cse3 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse3) 20)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse19 .cse3))) (= 20 .cse18))))))) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_23723 Int)) (not (= (select (store .cse21 (+ (* .cse22 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23723) .cse23) 20))) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (forall ((v_ArrVal_23708 Int) (v_ArrVal_23707 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int) (v_ArrVal_23714 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int)) (let ((.cse30 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse21 .cse23 (+ .cse22 1))) |c_~#stored_elements~0.base| v_ArrVal_23707))) (let ((.cse29 (select .cse30 |c_~#queue~0.base|))) (let ((.cse26 (store (store .cse30 |c_~#queue~0.base| (let ((.cse31 (store .cse29 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse31 .cse9 v_ArrVal_23711) .cse3 (+ (select .cse31 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse24 (select .cse26 |c_~#queue~0.base|))) (let ((.cse27 (store .cse24 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse28 (select .cse27 .cse3))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse24 .cse3))) (not (= (select (let ((.cse25 (select (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse9 v_ArrVal_23718) .cse3 (+ .cse28 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse25 (+ |c_~#queue~0.offset| (* (select .cse25 .cse3) 4)) v_ArrVal_23723)) .cse3) 20)) (= 20 .cse28) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| (select .cse29 .cse3))))))))))) (not (= .cse22 20)) (<= |c_~#stored_elements~0.base| 6) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| Int)) (or (forall ((v_ArrVal_23708 Int) (v_ArrVal_23714 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| Int) (v_ArrVal_23711 Int) (v_ArrVal_23721 (Array Int Int)) (v_ArrVal_23723 Int) (v_ArrVal_23715 Int) (v_ArrVal_23718 Int)) (let ((.cse33 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse37 (store .cse21 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437|)) v_ArrVal_23708))) (store (store .cse37 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_23711) .cse23 (+ (select .cse37 .cse23) 1)))) |c_~#stored_elements~0.base| v_ArrVal_23714))) (let ((.cse36 (select .cse33 |c_~#queue~0.base|))) (let ((.cse34 (store .cse36 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434|)) v_ArrVal_23715))) (let ((.cse35 (select .cse34 .cse3))) (or (not (= 20 (select (let ((.cse32 (select (store (store .cse33 |c_~#queue~0.base| (store (store .cse34 .cse9 v_ArrVal_23718) .cse3 (+ .cse35 1))) |c_~#stored_elements~0.base| v_ArrVal_23721) |c_~#queue~0.base|))) (store .cse32 (+ (* (select .cse32 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_23723)) .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_434| (select .cse36 .cse3))) (= .cse35 20))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_437| .cse22)))) (= (select |c_#valid| 7) 1)))) is different from false Received shutdown request... [2022-11-10 10:55:30,400 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 10:55:30,400 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 10:55:30,400 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 10:55:30,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-10 10:55:30,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-10 10:55:30,811 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 265 known predicates. [2022-11-10 10:55:30,812 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONDATA_RACE (11 of 12 remaining) [2022-11-10 10:55:30,813 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2022-11-10 10:55:30,813 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2022-11-10 10:55:30,813 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2022-11-10 10:55:30,813 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2022-11-10 10:55:30,813 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2022-11-10 10:55:30,813 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2022-11-10 10:55:30,813 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2022-11-10 10:55:30,813 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2022-11-10 10:55:30,813 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2022-11-10 10:55:30,813 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2022-11-10 10:55:30,814 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2022-11-10 10:55:30,821 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-10 10:55:30,822 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork1 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/3) [2022-11-10 10:55:30,824 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-10 10:55:30,824 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-10 10:55:30,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:55:30 BasicIcfg [2022-11-10 10:55:30,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-10 10:55:30,826 INFO L158 Benchmark]: Toolchain (without parser) took 782721.91ms. Allocated memory was 219.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 160.0MB in the beginning and 1.1GB in the end (delta: -890.4MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-11-10 10:55:30,826 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 219.2MB. Free memory is still 178.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-10 10:55:30,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.52ms. Allocated memory was 219.2MB in the beginning and 263.2MB in the end (delta: 44.0MB). Free memory was 159.8MB in the beginning and 215.4MB in the end (delta: -55.6MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-11-10 10:55:30,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.10ms. Allocated memory is still 263.2MB. Free memory was 215.4MB in the beginning and 210.1MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-11-10 10:55:30,827 INFO L158 Benchmark]: Boogie Preprocessor took 97.89ms. Allocated memory is still 263.2MB. Free memory was 210.1MB in the beginning and 205.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-11-10 10:55:30,827 INFO L158 Benchmark]: RCFGBuilder took 924.57ms. Allocated memory is still 263.2MB. Free memory was 205.5MB in the beginning and 165.5MB in the end (delta: 40.1MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2022-11-10 10:55:30,827 INFO L158 Benchmark]: TraceAbstraction took 780972.93ms. Allocated memory was 263.2MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 235.2MB in the beginning and 1.1GB in the end (delta: -815.1MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-11-10 10:55:30,828 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.11ms. Allocated memory is still 219.2MB. Free memory is still 178.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 602.52ms. Allocated memory was 219.2MB in the beginning and 263.2MB in the end (delta: 44.0MB). Free memory was 159.8MB in the beginning and 215.4MB in the end (delta: -55.6MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 96.10ms. Allocated memory is still 263.2MB. Free memory was 215.4MB in the beginning and 210.1MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 97.89ms. Allocated memory is still 263.2MB. Free memory was 210.1MB in the beginning and 205.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 924.57ms. Allocated memory is still 263.2MB. Free memory was 205.5MB in the beginning and 165.5MB in the end (delta: 40.1MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 780972.93ms. Allocated memory was 263.2MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 235.2MB in the beginning and 1.1GB in the end (delta: -815.1MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1939, positive: 1933, positive conditional: 8, positive unconditional: 1925, negative: 6, negative conditional: 4, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 1910, Positive cache size: 1908, Positive conditional cache size: 0, Positive unconditional cache size: 1908, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 4, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1938, positive: 1933, positive conditional: 8, positive unconditional: 1925, negative: 5, negative conditional: 3, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 1910, Positive cache size: 1908, Positive conditional cache size: 0, Positive unconditional cache size: 1908, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 7, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3965, positive: 3953, positive conditional: 18, positive unconditional: 3935, negative: 12, negative conditional: 7, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 4471, Positive cache size: 4464, Positive conditional cache size: 0, Positive unconditional cache size: 4464, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Independence queries for same thread: 14, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5359, positive: 5339, positive conditional: 29, positive unconditional: 5310, negative: 20, negative conditional: 7, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 7293, Positive cache size: 7276, Positive conditional cache size: 0, Positive unconditional cache size: 7276, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Independence queries for same thread: 21, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5920, positive: 5889, positive conditional: 37, positive unconditional: 5852, negative: 31, negative conditional: 8, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 10330, Positive cache size: 10293, Positive conditional cache size: 0, Positive unconditional cache size: 10293, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Independence queries for same thread: 29, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6602, positive: 6558, positive conditional: 46, positive unconditional: 6512, negative: 44, negative conditional: 9, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 11942, Positive cache size: 11883, Positive conditional cache size: 0, Positive unconditional cache size: 11883, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Independence queries for same thread: 38, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7381, positive: 7326, positive conditional: 55, positive unconditional: 7271, negative: 55, negative conditional: 10, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 12693, Positive cache size: 12624, Positive conditional cache size: 0, Positive unconditional cache size: 12624, Negative cache size: 69, Negative conditional cache size: 0, Negative unconditional cache size: 69, Independence queries for same thread: 48, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 9498, positive: 9420, positive conditional: 76, positive unconditional: 9344, negative: 78, negative conditional: 13, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 15330, Positive cache size: 15231, Positive conditional cache size: 0, Positive unconditional cache size: 15231, Negative cache size: 99, Negative conditional cache size: 0, Negative unconditional cache size: 99, Independence queries for same thread: 61, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 11207, positive: 11118, positive conditional: 90, positive unconditional: 11028, negative: 89, negative conditional: 14, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 17582, Positive cache size: 17463, Positive conditional cache size: 0, Positive unconditional cache size: 17463, Negative cache size: 119, Negative conditional cache size: 0, Negative unconditional cache size: 119, Independence queries for same thread: 75, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 12878, positive: 12783, positive conditional: 102, positive unconditional: 12681, negative: 95, negative conditional: 18, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 19594, Positive cache size: 19465, Positive conditional cache size: 0, Positive unconditional cache size: 19465, Negative cache size: 129, Negative conditional cache size: 0, Negative unconditional cache size: 129, Independence queries for same thread: 93, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 13349, positive: 13251, positive conditional: 108, positive unconditional: 13143, negative: 98, negative conditional: 18, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 20779, Positive cache size: 20645, Positive conditional cache size: 0, Positive unconditional cache size: 20645, Negative cache size: 134, Negative conditional cache size: 0, Negative unconditional cache size: 134, Independence queries for same thread: 111, Statistics for Abstraction: - StatisticsResult: Independence relation #12 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 15220, positive: 15109, positive conditional: 172, positive unconditional: 14937, negative: 111, negative conditional: 22, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 23266, Positive cache size: 23121, Positive conditional cache size: 0, Positive unconditional cache size: 23121, Negative cache size: 145, Negative conditional cache size: 0, Negative unconditional cache size: 145, Independence queries for same thread: 131, Statistics for Abstraction: - StatisticsResult: Independence relation #13 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 15408, positive: 15275, positive conditional: 338, positive unconditional: 14937, negative: 133, negative conditional: 44, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 23821, Positive cache size: 23676, Positive conditional cache size: 0, Positive unconditional cache size: 23676, Negative cache size: 145, Negative conditional cache size: 0, Negative unconditional cache size: 145, Independence queries for same thread: 173, Statistics for Abstraction: - StatisticsResult: Independence relation #14 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 16652, positive: 16509, positive conditional: 749, positive unconditional: 15760, negative: 143, negative conditional: 50, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 24481, Positive cache size: 24331, Positive conditional cache size: 0, Positive unconditional cache size: 24331, Negative cache size: 150, Negative conditional cache size: 0, Negative unconditional cache size: 150, Independence queries for same thread: 219, Statistics for Abstraction: - StatisticsResult: Independence relation #15 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 12643, positive: 12510, positive conditional: 168, positive unconditional: 12342, negative: 133, negative conditional: 25, negative unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 28569, Positive cache size: 28350, Positive conditional cache size: 0, Positive unconditional cache size: 28350, Negative cache size: 219, Negative conditional cache size: 0, Negative unconditional cache size: 219, Independence queries for same thread: 244, Statistics for Abstraction: - StatisticsResult: Independence relation #16 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 24436, positive: 23141, positive conditional: 5153, positive unconditional: 17988, negative: 1295, negative conditional: 829, negative unconditional: 466, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 30811, Positive cache size: 30339, Positive conditional cache size: 0, Positive unconditional cache size: 30339, Negative cache size: 472, Negative conditional cache size: 0, Negative unconditional cache size: 472, Independence queries for same thread: 661, Statistics for Abstraction: - StatisticsResult: Independence relation #17 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 26262, positive: 24891, positive conditional: 6400, positive unconditional: 18491, negative: 1371, negative conditional: 903, negative unconditional: 468, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32930, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 762, Negative conditional cache size: 0, Negative unconditional cache size: 762, Independence queries for same thread: 1145, Statistics for Abstraction: - StatisticsResult: Independence relation #18 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 31339, positive: 29156, positive conditional: 11272, positive unconditional: 17884, negative: 2183, negative conditional: 1715, negative unconditional: 468, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32930, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 762, Negative conditional cache size: 0, Negative unconditional cache size: 762, Independence queries for same thread: 2005, Statistics for Abstraction: - StatisticsResult: Independence relation #19 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 31368, positive: 29269, positive conditional: 11231, positive unconditional: 18038, negative: 2099, negative conditional: 1631, negative unconditional: 468, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32930, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 762, Negative conditional cache size: 0, Negative unconditional cache size: 762, Independence queries for same thread: 2826, Statistics for Abstraction: - StatisticsResult: Independence relation #20 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 19094, positive: 18865, positive conditional: 1995, positive unconditional: 16870, negative: 229, negative conditional: 101, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32930, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 762, Negative conditional cache size: 0, Negative unconditional cache size: 762, Independence queries for same thread: 2923, Statistics for Abstraction: - StatisticsResult: Independence relation #21 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 32971, positive: 30794, positive conditional: 12153, positive unconditional: 18641, negative: 2177, negative conditional: 1709, negative unconditional: 468, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32931, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 763, Negative conditional cache size: 0, Negative unconditional cache size: 763, Independence queries for same thread: 3819, Statistics for Abstraction: - StatisticsResult: Independence relation #22 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 20623, positive: 20227, positive conditional: 3357, positive unconditional: 16870, negative: 396, negative conditional: 268, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32931, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 763, Negative conditional cache size: 0, Negative unconditional cache size: 763, Independence queries for same thread: 4083, Statistics for Abstraction: - StatisticsResult: Independence relation #23 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 21811, positive: 21313, positive conditional: 3882, positive unconditional: 17431, negative: 498, negative conditional: 341, negative unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32931, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 763, Negative conditional cache size: 0, Negative unconditional cache size: 763, Independence queries for same thread: 4396, Statistics for Abstraction: - StatisticsResult: Independence relation #24 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 24771, positive: 24055, positive conditional: 6203, positive unconditional: 17852, negative: 716, negative conditional: 540, negative unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32932, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 764, Negative conditional cache size: 0, Negative unconditional cache size: 764, Independence queries for same thread: 4820, Statistics for Abstraction: - StatisticsResult: Independence relation #25 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 17473, positive: 17210, positive conditional: 2157, positive unconditional: 15053, negative: 263, negative conditional: 151, negative unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32932, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 764, Negative conditional cache size: 0, Negative unconditional cache size: 764, Independence queries for same thread: 4971, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 111, Number of trivial persistent sets: 106, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1939, positive: 1933, positive conditional: 8, positive unconditional: 1925, negative: 6, negative conditional: 4, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 1910, Positive cache size: 1908, Positive conditional cache size: 0, Positive unconditional cache size: 1908, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 4, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 109, Number of trivial persistent sets: 104, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1938, positive: 1933, positive conditional: 8, positive unconditional: 1925, negative: 5, negative conditional: 3, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 1910, Positive cache size: 1908, Positive conditional cache size: 0, Positive unconditional cache size: 1908, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 7, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 116, Number of trivial persistent sets: 107, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3965, positive: 3953, positive conditional: 18, positive unconditional: 3935, negative: 12, negative conditional: 7, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 4471, Positive cache size: 4464, Positive conditional cache size: 0, Positive unconditional cache size: 4464, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Independence queries for same thread: 14, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 127, Number of trivial persistent sets: 110, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 5359, positive: 5339, positive conditional: 29, positive unconditional: 5310, negative: 20, negative conditional: 7, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 7293, Positive cache size: 7276, Positive conditional cache size: 0, Positive unconditional cache size: 7276, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Independence queries for same thread: 21, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 134, Number of trivial persistent sets: 115, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 5920, positive: 5889, positive conditional: 37, positive unconditional: 5852, negative: 31, negative conditional: 8, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 10330, Positive cache size: 10293, Positive conditional cache size: 0, Positive unconditional cache size: 10293, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Independence queries for same thread: 29, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 142, Number of trivial persistent sets: 121, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6602, positive: 6558, positive conditional: 46, positive unconditional: 6512, negative: 44, negative conditional: 9, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 11942, Positive cache size: 11883, Positive conditional cache size: 0, Positive unconditional cache size: 11883, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Independence queries for same thread: 38, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 150, Number of trivial persistent sets: 126, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 7381, positive: 7326, positive conditional: 55, positive unconditional: 7271, negative: 55, negative conditional: 10, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 12693, Positive cache size: 12624, Positive conditional cache size: 0, Positive unconditional cache size: 12624, Negative cache size: 69, Negative conditional cache size: 0, Negative unconditional cache size: 69, Independence queries for same thread: 48, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 168, Number of trivial persistent sets: 136, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 9498, positive: 9420, positive conditional: 76, positive unconditional: 9344, negative: 78, negative conditional: 13, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 15330, Positive cache size: 15231, Positive conditional cache size: 0, Positive unconditional cache size: 15231, Negative cache size: 99, Negative conditional cache size: 0, Negative unconditional cache size: 99, Independence queries for same thread: 61, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 181, Number of trivial persistent sets: 141, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 11207, positive: 11118, positive conditional: 90, positive unconditional: 11028, negative: 89, negative conditional: 14, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 17582, Positive cache size: 17463, Positive conditional cache size: 0, Positive unconditional cache size: 17463, Negative cache size: 119, Negative conditional cache size: 0, Negative unconditional cache size: 119, Independence queries for same thread: 75, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 189, Number of trivial persistent sets: 143, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 12878, positive: 12783, positive conditional: 102, positive unconditional: 12681, negative: 95, negative conditional: 18, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 19594, Positive cache size: 19465, Positive conditional cache size: 0, Positive unconditional cache size: 19465, Negative cache size: 129, Negative conditional cache size: 0, Negative unconditional cache size: 129, Independence queries for same thread: 93, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 194, Number of trivial persistent sets: 146, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 13349, positive: 13251, positive conditional: 108, positive unconditional: 13143, negative: 98, negative conditional: 18, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 20779, Positive cache size: 20645, Positive conditional cache size: 0, Positive unconditional cache size: 20645, Negative cache size: 134, Negative conditional cache size: 0, Negative unconditional cache size: 134, Independence queries for same thread: 111, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 213, Number of trivial persistent sets: 165, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 15220, positive: 15109, positive conditional: 172, positive unconditional: 14937, negative: 111, negative conditional: 22, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 23266, Positive cache size: 23121, Positive conditional cache size: 0, Positive unconditional cache size: 23121, Negative cache size: 145, Negative conditional cache size: 0, Negative unconditional cache size: 145, Independence queries for same thread: 131, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 213, Number of trivial persistent sets: 165, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 15408, positive: 15275, positive conditional: 338, positive unconditional: 14937, negative: 133, negative conditional: 44, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 23821, Positive cache size: 23676, Positive conditional cache size: 0, Positive unconditional cache size: 23676, Negative cache size: 145, Negative conditional cache size: 0, Negative unconditional cache size: 145, Independence queries for same thread: 173, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 379, Number of trivial persistent sets: 332, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 16652, positive: 16509, positive conditional: 749, positive unconditional: 15760, negative: 143, negative conditional: 50, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 24481, Positive cache size: 24331, Positive conditional cache size: 0, Positive unconditional cache size: 24331, Negative cache size: 150, Negative conditional cache size: 0, Negative unconditional cache size: 150, Independence queries for same thread: 219, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 200, Number of trivial persistent sets: 158, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 12643, positive: 12510, positive conditional: 168, positive unconditional: 12342, negative: 133, negative conditional: 25, negative unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 28569, Positive cache size: 28350, Positive conditional cache size: 0, Positive unconditional cache size: 28350, Negative cache size: 219, Negative conditional cache size: 0, Negative unconditional cache size: 219, Independence queries for same thread: 244, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 1296, Number of trivial persistent sets: 983, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 24436, positive: 23141, positive conditional: 5153, positive unconditional: 17988, negative: 1295, negative conditional: 829, negative unconditional: 466, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 30811, Positive cache size: 30339, Positive conditional cache size: 0, Positive unconditional cache size: 30339, Negative cache size: 472, Negative conditional cache size: 0, Negative unconditional cache size: 472, Independence queries for same thread: 661, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 1433, Number of trivial persistent sets: 1084, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 26262, positive: 24891, positive conditional: 6400, positive unconditional: 18491, negative: 1371, negative conditional: 903, negative unconditional: 468, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32930, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 762, Negative conditional cache size: 0, Negative unconditional cache size: 762, Independence queries for same thread: 1145, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 1360, Number of trivial persistent sets: 1054, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 31339, positive: 29156, positive conditional: 11272, positive unconditional: 17884, negative: 2183, negative conditional: 1715, negative unconditional: 468, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32930, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 762, Negative conditional cache size: 0, Negative unconditional cache size: 762, Independence queries for same thread: 2005, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 1304, Number of trivial persistent sets: 998, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 31368, positive: 29269, positive conditional: 11231, positive unconditional: 18038, negative: 2099, negative conditional: 1631, negative unconditional: 468, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32930, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 762, Negative conditional cache size: 0, Negative unconditional cache size: 762, Independence queries for same thread: 2826, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 397, Number of trivial persistent sets: 349, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 19094, positive: 18865, positive conditional: 1995, positive unconditional: 16870, negative: 229, negative conditional: 101, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32930, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 762, Negative conditional cache size: 0, Negative unconditional cache size: 762, Independence queries for same thread: 2923, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 1405, Number of trivial persistent sets: 1056, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 32971, positive: 30794, positive conditional: 12153, positive unconditional: 18641, negative: 2177, negative conditional: 1709, negative unconditional: 468, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32931, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 763, Negative conditional cache size: 0, Negative unconditional cache size: 763, Independence queries for same thread: 3819, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 397, Number of trivial persistent sets: 349, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 20623, positive: 20227, positive conditional: 3357, positive unconditional: 16870, negative: 396, negative conditional: 268, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32931, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 763, Negative conditional cache size: 0, Negative unconditional cache size: 763, Independence queries for same thread: 4083, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 556, Number of trivial persistent sets: 454, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 21811, positive: 21313, positive conditional: 3882, positive unconditional: 17431, negative: 498, negative conditional: 341, negative unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32931, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 763, Negative conditional cache size: 0, Negative unconditional cache size: 763, Independence queries for same thread: 4396, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 671, Number of trivial persistent sets: 559, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 24771, positive: 24055, positive conditional: 6203, positive unconditional: 17852, negative: 716, negative conditional: 540, negative unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32932, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 764, Negative conditional cache size: 0, Negative unconditional cache size: 764, Independence queries for same thread: 4820, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 378, Number of trivial persistent sets: 333, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 17473, positive: 17210, positive conditional: 2157, positive unconditional: 15053, negative: 263, negative conditional: 151, negative unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 390107, positive: 377827, positive conditional: 65807, positive unconditional: 312020, negative: 12280, negative conditional: 8440, negative unconditional: 3840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 385136, positive: 377827, positive conditional: 0, positive unconditional: 377827, negative: 7309, negative conditional: 0, negative unconditional: 7309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 32932, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 764, negative conditional: 0, negative unconditional: 764, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 385136, positive: 345659, positive conditional: 0, positive unconditional: 345659, negative: 6545, negative conditional: 0, negative unconditional: 6545, unknown: 32932, unknown conditional: 0, unknown unconditional: 32932] , Statistics on independence cache: Total cache size (in pairs): 32932, Positive cache size: 32168, Positive conditional cache size: 0, Positive unconditional cache size: 32168, Negative cache size: 764, Negative conditional cache size: 0, Negative unconditional cache size: 764, Independence queries for same thread: 4971, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 265 known predicates. - TimeoutResultAtElement [Line: 1017]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 265 known predicates. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 265 known predicates. - TimeoutResultAtElement [Line: 980]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 265 known predicates. - TimeoutResultAtElement [Line: 980]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 265 known predicates. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 265 known predicates. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 265 known predicates. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 265 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 265 known predicates. - TimeoutResultAtElement [Line: 984]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 265 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 265 known predicates. - TimeoutResultAtElement [Line: 1015]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 265 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 726 locations, 63 error locations. Started 1 CEGAR loops. OverallTime: 780.7s, OverallIterations: 24, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 398.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 989, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.8s SsaConstructionTime, 8.3s SatisfiabilityAnalysisTime, 362.0s InterpolantComputationTime, 28836 NumberOfCodeBlocks, 23792 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 41059 ConstructedInterpolants, 1320 QuantifiedInterpolants, 2528003 SizeOfPredicates, 201 NumberOfNonLiveVariables, 24332 ConjunctsInSsa, 633 ConjunctsInUnsatCore, 46 InterpolantComputations, 14 PerfectInterpolantSequences, 247858/283081 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown